2018 icpc南京赛区网络赛 G题

segment tree

dfs

https://nanti.jisuanke.com/t/30996

#include<bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int inf = 1e9;
const int M = 2e5+10;
int sum[M<<2],n,k,q;
int a[M],b[M],x[M],y[M];

void update(int p,int c,int l,int r,int rt)
{
     if(l == r && l == p){
        sum[rt] = c;
        return ;
     }
     int m = (l + r) >> 1;
     if(p <= m) update(p,c,lson);
     else update(p,c,rson);
     sum[rt] = min(sum[rt<<1],sum[rt<<1|1]);
}

int query(int p,int l,int r,int rt)
{
    if(l == r) return l;
    int m = (l + r) >> 1;
    if(sum[rt<<1] <= p) return query(p,lson);
    if(sum[rt<<1|1] <= p) return query(p,rson);
    return -1;
}

int main()
{
    scanf("%d%d",&n,&k);
    for(int i = 1;i <= n;i ++){
        scanf("%id", &a[i]);
        update(i,a[i],1,n,1);
    }
    scanf("%d",&q);
    int mx = 0;
    for(int i = 1;i <= q;i++){
        scanf("%d",&b[i]);
        mx = max(b[i],mx);
    }
    int ans = 0, cnt = 0;
    for(int i = 1;i <= mx;i++){
        ans += k;
        while(1){   //一次更新可能有多个房间被填满
            int num = query(ans, 1, n, 1);
            if(num != -1) {
                cnt++, ans -= a[num];
                update(num, inf, 1, n, 1);
                x[i] = cnt, y[i] = ans;
            }
            else {
                x[i] = cnt, y[i] = ans;
                break;
            }
        }

    }
    for(int i = 1;i <= q;i++)
        printf("%d %d\n",x[b[i]],y[b[i]]);

    return 0;
}