BZOJ 2006超级钢琴

http://blog.csdn.net/zzkksunboy/article/details/76927058
写的很详细了，其实是一种贪心模板

#include <cstdio>
#include <queue>
#include <algorithm>
#define mk(A,B,C,D) make_pair(make_pair(A,B),make_pair(C,D))
using namespace std;
const int N=500005;
int n,k,l,r;
int f[N][25];
int L[N];
int s[N];
int v[N];
int minx(int a,int b)
{
    return s[a]<s[b]?a:b;
}
typedef pair<int,int> pii;
priority_queue<pair<pii,pii> > q;
int query(int a,int b)
{
    if(a>b)  return -1;
    int k=L[b-a+1];
    return minx(f[a][k],f[b-(1<<k)+1][k]);
}
int main()
{
    register int i,j;
    scanf("%d %d %d %d",&n,&k,&l,&r);
    for (i=2;i<=n;i++) L[i]=L[i>>1]+1;
    for (i=1;i<=n;i++)
    {
        f[i][0]=i;
        scanf("%d",&v[i]);
        s[i]=s[i-1]+v[i];
    }
    for (j=1;(1<<j)<=n;j++)
    for (i=0;i+(1<<j)-1<=n;i++)
    f[i][j]=minx(f[i][j-1],f[i+(1<<j-1)][j-1]);
    for (i=l;i<=n;i++) q.push(mk(s[i]-s[query(max(i-r,0),i-l)],i,max(i-r,0),i-l));
    long long ans=0;
    int x,y,a,b,c,d;
    for (i=1;i<=k;i++)
    {
        pii t1=q.top().first;pii t2=q.top().second;
        ans+=t1.first,x=t1.second,a=t2.first,b=t2.second,y=query(a,b),q.pop();
        c=query(a,y-1),d=query(y+1,b);
        if(c!=-1) q.push(mk(s[x]-s[c],x,a,y-1));
        if(d!=-1) q.push(mk(s[x]-s[d],x,y+1,b));
    }
    printf("%lld",ans);
}