栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 1484 Blowing Fuses

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 1484 Blowing Fuses

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 25int 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(){    int t = 0;    while (scanf("%d%d%d", &n, &m, &blow), n | m | blow)    {        t++;        printf("Sequence %dn", t);        input();        putchar('n');    }    return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/374486.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号