codeforce round 325 C/D/E

C

#include<bits/stdc++.h>
using namespace std;
const int MAX_N=4010;

int n;
long long d[MAX_N],p[MAX_N],v[MAX_N];
int cure[MAX_N];

int main()
{
    freopen("C.in","r",stdin);
    while(~scanf("%d",&n)){
        int ans=0;
        for(int i=0;i<n;i++){
            scanf("%I64d%I64d%I64d",&v[i],&d[i],&p[i]);
        }
        for(int i=0;i<n;i++){
            if(p[i]<0) continue;
            cure[ans++]=i+1;
            long long cur=v[i],extra=0;
            for(int j=i+1;j<n;j++){
                if(p[j]<0) continue;
                p[j]-=(cur+extra);
                if(p[j]<0) extra += d[j];
                if(cur>0) cur--;
            }
        }
        printf("%d\n",ans);
        for(int i=0;i<ans;i++){
            printf("%d ",cure[i]);
        }
        printf("\n");
    }
    return 0;
}

View Code