pku1484.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>

int st[30], val[30];
int n, m, c;

int main()
{
	int max, tmp, i, t, id;
	t = 1;
	while (scanf("%d %d %d", &n, &m, &c) != -1 && (n + m + c))
	{
		max = 0;
		tmp = 0;
		memset(st, 0, sizeof(st));
		for (i = 1; i <= n; i++)
		{
			scanf("%d", &val[i]);
		}
		for (i = 0; i < m; i++)
		{
			scanf("%d", &id);
			if (id <= 0 || id > n)
			{
				continue;
			}
			if (st[id] == 0)
			{
				tmp += val[id];
				st[id] = 1;
				if (tmp > max)
				{
					max = tmp;
				}
			}
			else
			{
				tmp -= val[id];
				st[id] = 0;
			}
		}
		printf("Sequence %d\n", t++);
		if (max > c)
		{
			printf("Fuse was blown.");
		}
		else
		{
			printf("Fuse was not blown.\nMaximal power consumption was %d amperes.", max);
		}
		printf("\n\n");
	}
	return 0;
}