NOI2011 NOI嘉年华

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<utility>
#include<set>
#include<bitset>
#include<vector>
#include<functional>
#include<deque>
#include<cctype>
#include<climits>
#include<complex>
//#include<bits/stdc++.h>适用于CF,UOJ，但不适用于poj
 
using namespace std;

typedef long long LL;
typedef double DB;
typedef pair<int,int> PII;
typedef complex<DB> CP;

#define mmst(a,v) memset(a,v,sizeof(a))
#define mmcy(a,b) memcpy(a,b,sizeof(a))
#define re(i,a,b)  for(i=a;i<=b;i++)
#define red(i,a,b) for(i=a;i>=b;i--)
#define fi first
#define se second
#define m_p(a,b) make_pair(a,b)
#define SF scanf
#define PF printf
#define two(k) (1<<(k))

template<class T>inline T sqr(T x){return x*x;}
template<class T>inline void upmin(T &t,T tmp){if(t>tmp)t=tmp;}
template<class T>inline void upmax(T &t,T tmp){if(t<tmp)t=tmp;}

const DB EPS=1e-9;
inline int sgn(DB x){if(abs(x)<EPS)return 0;return(x>0)?1:-1;}
const DB Pi=acos(-1.0);

inline int gint()
  {
        int res=0;bool neg=0;char z;
        for(z=getchar();z!=EOF && z!=‘-‘ && !isdigit(z);z=getchar());
        if(z==EOF)return 0;
        if(z==‘-‘){neg=1;z=getchar();}
        for(;z!=EOF && isdigit(z);res=res*10+z-‘0‘,z=getchar());
        return (neg)?-res:res; 
    }
inline LL gll()
  {
      LL res=0;bool neg=0;char z;
        for(z=getchar();z!=EOF && z!=‘-‘ && !isdigit(z);z=getchar());
        if(z==EOF)return 0;
        if(z==‘-‘){neg=1;z=getchar();}
        for(;z!=EOF && isdigit(z);res=res*10+z-‘0‘,z=getchar());
        return (neg)?-res:res; 
    }

const int maxN=200;
const int maxcnt=2*maxN;

int N;
struct Tdata{int l,r,id;}a[maxN+10];

int cnt,bak[2*maxN+100];

int t[maxcnt+10];
int H[maxcnt+10][maxcnt+10];

inline bool cmpr(Tdata x,Tdata y){return x.r<y.r;}

int F[maxcnt+10][maxN+10],G[maxcnt+10][maxN+10];

int T[maxcnt+10][maxcnt+10];

int ans,res[maxN+10];

int main()
  {
      /*freopen("show.in","r",stdin);
      freopen("show.out","w",stdout);*/
      int i,j,k;
      N=gint();
      re(i,1,N)a[i].l=gint(),a[i].r=a[i].l+gint()-1,a[i].id=i;
      re(i,1,N)bak[++cnt]=a[i].l,bak[++cnt]=a[i].r;
      sort(bak+1,bak+cnt+1);
      cnt=unique(bak+1,bak+cnt+1)-bak-1;
      re(i,1,N)a[i].l=lower_bound(bak+1,bak+cnt+1,a[i].l)-bak,a[i].r=lower_bound(bak+1,bak+cnt+1,a[i].r)-bak;
      
      sort(a+1,a+N+1,cmpr);
      int head=1;
      re(i,1,cnt)
        {
            while(head<=N && a[head].r<=i)t[a[head].l]++,head++;
            int sum=0;
            red(j,i,1)sum+=t[j],H[j][i]=sum;
        }
      
      mmst(F,-1);
      F[0][0]=0;
      re(i,0,cnt-1)
        {
            red(j,N-1,0)upmax(F[i][j],F[i][j+1]);
            re(j,0,N)
            {
                if(F[i][j]!=-1)re(k,i+1,cnt)upmax(F[k][j],F[i][j]+H[i+1][k]);
                if(F[i][j]!=-1)re(k,i+1,cnt)upmax(F[k][j+H[i+1][k]],F[i][j]);
            }
        }
      
      mmst(G,-1);
      G[cnt+1][0]=0;
      red(i,cnt+1,2)
        {
            red(j,N-1,0)upmax(G[i][j],G[i][j+1]);
            re(j,0,N)
            {
                if(G[i][j]!=-1)re(k,1,i-1)upmax(G[k][j],G[i][j]+H[k][i-1]);
                if(G[i][j]!=-1)re(k,1,i-1)upmax(G[k][j+H[k][i-1]],G[i][j]);
            }
        }
      
      ans=0;
      re(j,0,N)upmax(ans,min(j,F[cnt][j]));
      cout<<ans<<endl;
      
      re(i,1,cnt)re(j,i,cnt)
        {
            T[i][j]=0;
            /*int x,y;
            re(x,0,N)re(y,0,N)
              if(F[i-1][x]!=-1 && G[j+1][y]!=-1)
                upmax(T[i][j],min(x+y+H[i][j],F[i-1][x]+G[j+1][y]));*/
            int x,y=N;
            while(y-1>=0 && G[j+1][y]==-1)y--;
            re(x,0,N)
              {
                  if(F[i-1][x]==-1)continue;
                  while(y-1>=0 && min(x+y+H[i][j],F[i-1][x]+G[j+1][y])<=min(x+y-1+H[i][j],F[i-1][x]+G[j+1][y-1]))y--;
                  upmax(T[i][j],min(x+y+H[i][j],F[i-1][x]+G[j+1][y]));
              }
        }
      
      re(i,1,N)
        {
            int l=a[i].l,r=a[i].r,id=a[i].id;
            res[id]=0;
            re(j,1,l)re(k,r,cnt)upmax(res[id],T[j][k]);
        }
      
      re(i,1,N)cout<<res[i]<<endl;
      
      return 0;
  }