Indegested Posters

In Nankai University, the poster board in front of Third Student Dining Hall is the most popular one among students. There are so many posters expected to be post there that the Students' Union have to arrange them to satisfy as many applicants as possible. Then Students' Union finds you are the one who can solve this problem by your programming genius. To help you to finish this job, Students' Union sets some rules as followed.

1.         All posters should have the same height with the board.

2.         No posters can overlay other posters. But their edges can be covered because no contents are on edges.

Every applicant wants his poster to be post as left as possible and assigns a line that his poster should be on the left side of this line. Or he will not admit Students' Union's arrangement and cancel his application.

Your task is to calculate how many posters can be post as most. The location of the left edge of board is assigned to be 0.

 

Input     (Please use standard input, and don’t read or write files.)
The first line contains an integer N, the number of posters (0< N <= 800000). It is followed by N lines. Each line contains two integers: W, the width of the poster (0< W <=1000), and R, its rightmost position (0< R <2 * 106).
Output   (Please use standard output, and don’t read or write files.)
The number of posters you can put on the board at most.
Sample Input	Sample Output
6 6 8 4 9 7 15 8 20 3 21 5 22	4

#include<stdio.h> #include<stdlib.h> void change(bool* record,int n,int& x) { int i,j,count=0; for(i=n-1;i>-1;i--) { if(record[i]==false) { if(i==(n-1-count)) { count++; record[i]=true; }else{ count++; record[i]=true; for(j=i+1;j<i+1+count;j++) record[j]=false; return; } if(count>x) { x++; for(j=0;j<=x&&x<n;j++) record[j]=false; return; } } } } int main() { int n,i,j,count; scanf("%d",&n); int* width; int* rightmost; width=(int *)malloc(sizeof(int)*n); rightmost=(int *)malloc(sizeof(int)*n); for(i=0;i<n;i++) { getchar(); scanf("%d%d",width+i,rightmost+i); } for(i=1;i<n;i++) for(j=i;(j>0)&&rightmost[j]<rightmost[j-1];j--) { count=rightmost[j]; rightmost[j]=rightmost[j-1]; rightmost[j-1]=count; } bool* record; record=(bool*)malloc(sizeof(bool)*n); for(i=0;i<n;i++) record[i]=true; j=-1; do{ count=0; for(i=0;i<n;i++) { if(record[i]) count+=width[i]; if(count>rightmost[i]) break; } if(i==n||count<=rightmost[i]) break; if(j==-1) { record[0]=false; j++; } else change(record,n,j); }while(j<n); printf("%d/n",n-j-1); return 0; }