Arrangement for Contests UVALive - 8519

点击打开链接

贪心的思想 线段树操作

每次取区间最小值 然后拿掉这个最小值 并不影响区间内非最小值的匹配

#include 
using namespace std;
#define N 0x3f3f3f3f

struct node1
{
    int l;
    int r;
    int minn;
    int pos;
    int laz;
};

struct node2
{
    int minn;
    int pos;
};

node1 tree[400010];
int n,p;

void pushup(int cur)
{
    if(tree[2*cur].minntem.minn) res=tem;
    }
    if(pr>=tree[2*cur+1].l)
    {
        tem=query(pl,pr,2*cur+1);
        if(res.minn>tem.minn) res=tem;
    }
    return res;
}

void update(int pl,int pr,int val,int cur)
{
    if(pl<=tree[cur].l&&tree[cur].r<=pr)
    {
        tree[cur].minn-=val;
        tree[cur].laz+=val;
        return;
    }
    pushdown(cur);
    if(pl<=tree[2*cur].r) update(pl,pr,val,2*cur);
    if(pr>=tree[2*cur+1].l) update(pl,pr,val,2*cur+1);
    pushup(cur);
    return;
}

int main()
{
    node2 tem;
    int t,k,ans;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&k);
        build(1,n,1);
        ans=0;
        p=1;
        while(p+k-1<=n)
        {
            tem=query(p,p+k-1,1);
            ans+=tem.minn;
            update(p,p+k-1,tem.minn,1);
            p=tem.pos+1;
        }
        printf("%d\n",ans);
    }
    return 0;
}