金中欢乐赛 A题

题目传送门

这道题就贪心.... 正的一坨和负的一坨间隔

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
#include<cstdlib>
#define LL long long
using namespace std;
const int M=;
LL read(){
    LL ans=,f=,c=getchar();
    while(c<''||c>''){if(c=='-') f=-; c=getchar();}
    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}
    return ans*f;
}
LL lx[M],rx[M],w[M];
LL n,k,tot;
LL cnt=;
LL sum[M],ans;
bool f[M];
struct node{
    LL w,pos;
    bool operator<(const node &x) const{return w>x.w;}
};
priority_queue<node>q;
LL pd(LL x){return x>=?x:-x;}
int main()
{
    //freopen("input.in","r",stdin);
    LL v;
    n=read(); k=read();
    for(int i=;i<=n;i++){
        v=read();
        if(v*sum[cnt]>=) sum[cnt]+=v;
        else sum[++cnt]=v;
    }
    if(sum[]*sum[cnt]>=) sum[]=sum[cnt]+sum[],cnt--;
    for(int i=;i<=cnt;i++)
        if(sum[i]>) ans+=sum[i],tot++;
    //printf("%lld\n",ans);
    if(tot<=k){printf("%lld\n",ans); return ;}
    LL now=tot-k; //printf("[%lld]\n",ans);
    q.push((node){pd(sum[]),});
    lx[]=cnt; rx[]=; w[]=pd(sum[]);
    q.push((node){pd(sum[cnt]),cnt});
    lx[cnt]=cnt-; rx[cnt]=; w[cnt]=pd(sum[cnt]);
    for(int i=;i<cnt;i++)
        q.push((node){pd(sum[i]),i}),lx[i]=i-,rx[i]=i+,w[i]=pd(sum[i]);//printf("%d\n",pd(sum[i]));
    //printf("[%d]\n",now);
    while(now){
        node x=q.top(); q.pop();
        LL k=x.pos;
        if(f[k]) continue;
        //printf("%lld\n",w[k]);
        ans-=w[k]; now--;
        LL l=lx[k],r=rx[k];
        f[l]=; f[r]=;
        cnt++;
        sum[cnt]=sum[k]+sum[l]+sum[r];
        w[cnt]=pd(sum[cnt]);
        q.push((node){w[cnt],cnt});
        lx[cnt]=lx[l]; rx[cnt]=rx[r];
        rx[lx[l]]=cnt; lx[rx[r]]=cnt;
    }
    //printf("%lld\n",cnt);
    printf("%lld\n",ans);
    return ;
}