milking cows

除了输入输出，没有用其他函数

/*
ID:rongkan1
LANG: C++
PROG:milk2
*/
#include <stdio.h>
class vector
{

public:	//l是最大索引
	//
	vector(int l){
		size =l+1;
		flags = new int[size];
		for(int i=0;i<size;i++){
		    flags[i]=0;
		}
	}
	int *flags;
	int size;
	int* operator[](int index){
		if(index>size-1){
			int newsize=index+1001;  //每次增加1000
			int *d=new int[newsize];
			for(int i=0;i<size;i++){ //复制flags
				d[i]=flags[i];
			}
	        
			for(int j=size;j<newsize;j++){ //初始化后面
			    d[j]=0;
			}
			delete flags;
			flags=d;
			size=newsize;
		}
	    return &flags[index];
		
	}
};

int main()
{
	FILE *fin = fopen("milk2.in","r"), *fout = fopen("milk2.out","w");
	int n,i,j,a1,a2;
	vector flags(1);
	fscanf(fin,"%d",&n); 
	for(i=0;i<n;i++){
		fscanf(fin,"%d %d",&a1,&a2);
		for(j = a1+1;j<= a2; j++){
			*flags[j]=1;
		}
	}
	int flag,curflag=0,begin = 0, end =0,mbusy=0,midle=0,c;
	for(int i=0;i<flags.size;i++){
		flag = *flags[i];
		if(i == flags.size-1&& flag==1){  //如果到达最后点，并且最后为1，最后为0在下面已经考虑
			end = i;
			if(curflag==0){        //
                c=end - begin;
				midle = midle>c?midle:c;
				mbusy = mbusy>1?mbusy:1;
			}
			else{         
				c= end - begin + 1;
				mbusy = mbusy>c?mbusy:c;
			}
			break;
		}
		if(flag != curflag){
			if(begin != 0){
				end=i;
				c=end - begin;
				if( curflag == 1)
					mbusy = mbusy>c?mbusy:c;
				else
					midle = midle>c?midle:c;
			}
			begin =i;
			curflag=flag;
		}
	}

	fprintf(fout,"%d %d\n",mbusy,midle);
    fclose(fin);fclose(fout);
}