簡單題

View Code #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define maxn 25

int n, m, blow, power[maxn];
bool on[maxn];

void out(int a)
{
int b = m - a - 1;
int x;
for (int i = 0; i < b; i++)
scanf("%d", &x);
}

void input()
{
memset(on, 0, sizeof(on));
for (int i = 0; i < n; i++)
scanf("%d", &power[i]);
int sum = 0;
int ans = 0;
for (int i = 0; i < m; i++)
{
int a;
scanf("%d", &a);
a--;
if (!on[a])
sum += power[a];
else
sum -= power[a];
on[a] = !on[a];
ans = max(ans, sum);
if (sum > blow)
{
out(i);
printf("Fuse was blown.\n");
return;
}
}
printf("Fuse was not blown.\n");
printf("Maximal power consumption was %d amperes.\n", ans);
}

int main()
{
//freopen("t.txt", "r", stdin);
int t = 0;
while (scanf("%d%d%d", &n, &m, &blow), n | m | blow)
{
t++;
printf("Sequence %d\n", t);
input();
putchar('\n');
}
return 0;
}

轉(zhuǎn)載于:https://www.cnblogs.com/rainydays/archive/2011/08/01/2123468.html

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎勵來咯，堅持創(chuàng)作打卡瓜分現(xiàn)金大獎

總結(jié)

以上是生活随笔為你收集整理的poj1484的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。