Codeforces Round #249 (Div. 2)453C Cardiogram(模拟)

关注

原创最新推荐文章于 2026-05-31 11:13:19 发布 1k 阅读 AI 写同款· GEO 优化 ›

Python爬虫实战：巧用HEAD请求和Cookie令牌绕过沃尔玛反爬（附完整代码）本文详细介绍了如何利用Python爬虫技术，通过HEAD请求和Cookie令牌绕过沃尔玛的反爬机制。文章深入解析了人机验证系统的运作原理，并提供了完整的工程化实现代码，包括令牌池设计、高并发架构和异常处理策略，帮助开发者高效采集电商数据。阅读详情

In this problem, your task is to use ASCII graphics to paint a cardiogram.

A cardiogram is a polyline with the following corners:

$\text{[math]}$

That is, a cardiogram is fully defined by a sequence of positive integers a1, a2, ..., an.

Your task is to paint a cardiogram by given sequence ai.

Input

The first line contains integer n (2 ≤ n ≤ 1000). The next line contains the sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 1000). It is guaranteed that the sum of all ai doesn't exceed 1000.

Output

Print max |yi - yj| lines (where yk is the y coordinate of the k-th point of the polyline), in each line print $\text{[math]}$ 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.

Sample test(s)

input
5
3 1 2 5 1

output
      / \     
   / \ /   \    
  /       \   
 /         \  
          \ / 

input
3
1 5 1

output
 / \     
  \    
   \   
    \  
     \ / 

这题不就是阅读理解吗。。然而6级还是挂了奇数的时候向上输出，偶数的时候向下输出。字符数组开大些，还要存空格。

AC代码：

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int MAXN = 1100;
int n, x, y, up, down, a[MAXN];
char map[MAXN][MAXN];
int main(int argc, char const *argv[])
{
	scanf("%d", &n);
	for(int i = 0; i < n; ++i) {
		scanf("%d", a + i);
		x += a[i];
		if(i % 2 == 0) y += a[i];
		else y -= a[i];
		up = max(y, up);
		down = min(y, down);
	}
	int num = x;
	x = up, y = 0;
	memset(map, ' ', sizeof(map));
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < a[i]; ++j)
			if(i % 2 == 0) {
				map[x][y] = '/';
				x--, y++;
			}
			else {
				map[x][y] = '\\';
				x++, y++;
			}
		if(i % 2 == 0) x++;
		else x--;
	}
	for(int i = 1; i <= up - down; ++i) {
		for(int j = 0; j < num; ++j)
			printf("%c", map[i][j]);
		printf("\n");
	}
	return 0;
}