2019牛客国庆集训派对day4 E Partial Sum （思维 + 贪心 + 排序）

题目链接：https://ac.nowcoder.com/acm/contest/1109/E
占坑，之后有空写详解

代码

#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
#define maxm 1006
#define ll long long int
#define INF 0x3f3f3f3f
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,r,l) for(int i=r;i>=l;i--)
#define mem(a) memset(a,0,sizeof(a))
#define sqr(x) (x*x)
#define inf (ll)2e18+1
#define PI acos(-1)
#define mod 10007
#define auto(i,x) for(int i=head[x];i;i=ed[i].nxt)
ll read(){
    ll x=0,f=1ll;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
     while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
     return f*x;
}
int n,m,c,a[maxn];
ll sum[maxn];
int xx[maxn],yy[maxn];
bool vis[maxn];
bool cmp1(int x,int y){
    if(sum[x]!=sum[y])return sum[x]>sum[y];
    return x>y;
}
bool cmp2(int x,int y){
    if(sum[x]!=sum[y])return sum[x]<sum[y];
    return x<y;
}
int main()
{
    while(~scanf("%d%d%d",&n,&m,&c)){
        inc(i,1,n)a[i]=read();
        inc(i,1,n)sum[i]=sum[i-1]+a[i];
        inc(i,0,n)xx[i]=yy[i]=i;
        sort(xx,xx+n+1,cmp1);sort(yy,yy+n+1,cmp2);
        inc(i,0,n)vis[i]=0;
        int p1=n,p2=n;
        ll ans=0;
        while(p1>=0&&p2>=0&&m){
            if(vis[xx[p1]]){p1--;continue; }
            if(vis[yy[p2]]){p2--;continue; }
            ll tmp=abs(sum[xx[p1]]-sum[yy[p2]]);
            if(tmp<=c)break;
            ans+=tmp-c;
            vis[xx[p1]]=1;vis[yy[p2]]=1;
            p1--;p2--;m--;
        }
        printf("%lld\n",ans);
    }
    return 0;
}