acgo题库
  • 首页
  • 题库
  • 题单
  • 竞赛
  • 讨论
  • 排行
  • 备赛专区

    竞赛

    • CSP-J/S
    • 蓝桥杯

    考级

    • GESP
    • CPA
    • 电子学会考级
登录
注册
题目详情题解(0)讨论(0)提交记录(0)
  • 首A

    #include <bits/stdc++.h> using namespace std; int n; string opt; int x,y; int s1[1000],s2[1000]; int e1[1000],e2[1000]; struct cz{ string mtd; int up,dn; }; int cnt=0; cz m[1000]; int main(){ cin>>n; s2[0]=INT_MAX-1000; for (int i = 1;i<=n;i++){ cin>>opt>>x>>y; if (opt=="off"){ m[n-cnt]={"off",x,y}; cnt++; s1[i]=max(0,s1[i-1]-y); s2[i]=max(0,s2[i-1]-x); } else if(opt=="none"){ m[n-cnt]={"none",x,y}; cnt++; s1[i]=max(x,s1[i-1]); s2[i]=min(y,s2[i-1]); } else{ m[n-cnt]={"on",x,y}; cnt++; s1[i]=s1[i-1]+x,s2[i]=s2[i-1]+y; } } int ans1=s1[n],ans2=s2[n]; s1[1]=s1[n],s2[1]=s2[n]; for (int i = 1;i<=n;i++){ x=m[i].up,y=m[i].dn,opt=m[i].mtd; if (opt=="on"){ s1[i]=max(0,s1[i-1]-y); s2[i]=max(0,s2[i-1]-x); } else if(opt=="none"){ s1[i]=max(x,s1[i-1]); s2[i]=min(y,s2[i-1]); } else{ s1[i]=s1[i-1]+x,s2[i]=s2[i-1]+y; } } cout<<s1[n]<<" "<<s2[n]<<endl; cout<<ans1<<" "<<ans2<<endl; return 0; }

    userId_undefined

    ACOI

    倔强青铜
    0阅读
    0回复
    0点赞
首页