1623.cpp

这是哈尔滨工业大学acmOJ的源代码

/* This Code is Submitted by wywcgs for Problem 1623 on 2007-01-19 at 21:43:41 */
#include <cstdio>
#include <cstring>
 
const int MAX = 32;
 
int main()
{
	int con[MAX], fuse;
	bool open[MAX];
	int n, m;
	int i, t;
	
	for(t = 1; scanf("%d %d %d", &n, &m, &fuse) != EOF && n*m != 0; t++) {
		for(i = 1; i <= n; i++) {
			scanf("%d", &con[i]);
		}
		int max = 0, cur = 0;
		memset(open, false, sizeof(open));
		for(i = 0; i < m; i++) {
			int order;
			scanf("%d", &order);
			open[order] = !open[order];
			if(open[order]) {
				cur += con[order];
			} else {
				cur -= con[order];
			}
			if(cur > max) {
				max = cur;
			}
		}
		printf("Sequence %d\n", t);
		if(max > fuse) {
			printf("Fuse was blown.\n");
		} else {
			printf("Fuse was not blown.\n");
			printf("Maximal power consumption was %d amperes.\n", max);
		}
		putchar('\n');
	}
	
	return 0;
}