← 返回题目
题库练习 Cardiogram
← 上一题 下一题 →

A9542 | Cardiogram

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

The first line contains integer $n$ $(2<=n<=1000)$ . The next line contains the sequence of integers $a_{1},a_{2},...,a_{n}$ $(1<=a_{i}<=1000)$ . It is guaranteed that the sum of all $a_{i}$ doesn't exceed $1000$ .

输入格式

Print $max |y_{i}-y_{j}|$ lines (where $y_{k}$ is the $y$ coordinate of the $k$ -th point of the polyline), in each line print ![](/uploads/acgo/image/759d0e371943c5e8_726c5a47423b.jpeg) characters. Each character must equal either « $/$ » (slash), « $\$ » (backslash), « » (space). The printed image must be the image of the given polyline. Please study the test samples for better understanding of how to print a cardiogram.

Note that in this problem the checker checks your answer taking spaces into consideration. Do not print any extra characters. Remember that the wrong answer to the first pretest doesn't give you a penalty.

输出格式

Due to the technical reasons the answers for the samples cannot be copied from the statement. We've attached two text documents with the answers below.

http://assets.codeforces.com/rounds/435/1.txt

http://assets.codeforces.com/rounds/435/2.txt

输入输出样例

输入 #1
5
3 1 2 5 1
输出 #1
     <span class="tex-span"> / </span><span class="tex-span">\</span>     
  <span class="tex-span"> / </span><span class="tex-span">\</span><span class="tex-span"> / </span>  <span class="tex-span">\</span>    
 <span class="tex-span"> / </span>      <span class="tex-span">\</span>   
<span class="tex-span"> / </span>        <span class="tex-span">\</span>  
          <span class="tex-span">\</span><span class="tex-span"> / </span>
输入 #2
3
1 5 1
输出 #2
<span class="tex-span"> / </span><span class="tex-span">\</span>     
  <span class="tex-span">\</span>    
   <span class="tex-span">\</span>   
    <span class="tex-span">\</span>  
     <span class="tex-span">\</span><span class="tex-span"> / </span>
C++ 编辑器
输入
输出