比赛链接

期望得分:100+20+20

实际得分:40+20+30

awa  cccc

T1 :基于贪心的思路,然后开始爆搜(雾

那必然是会死的,好吧他就是死了

#include<iostream>
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
int n,q,m;
int ans,sum=-1;
int a[400005];
int x,y;
inline int read();
int cha() {
    int ans=-1;
    for(int i=1; i<=n; i++)ans=max(ans,a[i]);
    return ans;
}
signed main() {
    n=read(),m=read(),q=read();
    for(int i=1; i<=n; i++) {
        a[i]=read();
        ans+=a[i];
        sum=max(a[i],sum);
    }
    if(sum*m>=ans)cout<<sum<<"\n";
    else {
        sum=ans/m;
        if(ans%m)sum++;
        cout<<sum<<"\n";
    }
    while(q--) {
        x=read(),y=read();
        ans+=y-a[x];
        if(y<a[x]&&a[x]==sum)a[x]=y,sum=cha();
        a[x]=y;
        if(y>sum)sum=y;
        if(sum*m>=ans)cout<<sum<<"\n";
        else {
            sum=ans/m;
            if(ans%m)sum++;
            cout<<sum<<"\n";
        }
    }
    return 0;
}
inline int read() {
    int s=0,w=1;
    char ch=getchar();
    while(ch<'0'||ch>'9') {
        if(ch=='-')w=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
        s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
    return s*w;
}
View Code

相关文章:

  • 2021-12-21
  • 2022-12-23
  • 2021-06-01
  • 2022-01-21
  • 2021-12-26
  • 2022-02-16
  • 2021-09-20
  • 2022-02-19
猜你喜欢
  • 2022-02-24
  • 2022-02-19
  • 2021-07-23
  • 2021-07-06
  • 2022-12-23
  • 2021-11-23
  • 2021-11-28
相关资源
相似解决方案