USACO SECTION 1.2 Milking Cows

Milking Cows

SAMPLE INPUT (file milk2.in)

3
300 1000
700 1200
1500 2100

OUTPUT FORMAT

A single line with two integers that represent the longest continuous time of milking and the longest idle time.

SAMPLE OUTPUT (file milk2.out)

900 300

/*
ID: conicoc1
LANG: C
TASK: milk2
*/
#include<stdio.h>
#include<stdlib.h>

struct Milking
{
	int StartTime;
	int EndTime;
};

int comp(const void *a,const void *b)
{
	struct Milking *p1,*p2;
	p1=(struct Milking*)a;
	p2=(struct Milking*)b;
	return p1->StartTime-p2->StartTime;
}

int main()
{
	FILE *fin,*fout;
	fin=fopen("milk2.in","r");
	fout=fopen("milk2.out","w");
	int FarmerNumber,i;
	fscanf(fin,"%d",&FarmerNumber);
	struct Milking *Farmer=(struct Milking *)malloc(sizeof(struct Milking)*FarmerNumber);
	
	for(i=0;i<FarmerNumber;i++)
	{
		fscanf(fin,"%d %d",&Farmer[i].StartTime,&Farmer[i].EndTime);
	}
	
	qsort(Farmer,FarmerNumber,sizeof(struct Milking),comp);
	
	int LongestTime=Farmer[0].EndTime-Farmer[0].StartTime;
	int LongTmp=0;    //储存临时最长时间 
	int ShortestTime=0;
	int TimeTmp=Farmer[0].EndTime; //记录当前end时间 
	int flag=0;    //判断是否连续的标记。 
	

	for(i=0;i<FarmerNumber-1;i++)
	{
		if(TimeTmp<Farmer[i+1].StartTime)
		{
			if(ShortestTime<Farmer[i+1].StartTime-TimeTmp)
				ShortestTime=Farmer[i+1].StartTime-TimeTmp;
			flag=0;
			if(LongestTime<LongTmp)
				LongestTime=LongTmp;
			LongTmp=Farmer[i+1].EndTime-Farmer[i+1].StartTime;
			TimeTmp=Farmer[i+1].EndTime;
		}
		else
		{
			if(flag)
			{
				if(Farmer[i+1].EndTime>TimeTmp)
				{
					LongTmp+=Farmer[i+1].EndTime-TimeTmp;
					TimeTmp=Farmer[i+1].EndTime;
				}
			}
			else
			{
				if(Farmer[i+1].EndTime<TimeTmp)
				{
					TimeTmp=Farmer[i].EndTime;
				}
				else
					TimeTmp=Farmer[i+1].EndTime;
				
				LongTmp=TimeTmp-Farmer[i].StartTime;
			}
			flag=1;	
		}
	}
	
	fprintf(fout,"%d %d\n",LongestTime,ShortestTime);

			
	return 0;
	
}

 

我的方法和官方给的2是一样的。。第一种是开辟一个很大的数组作为时间标记

现在看这道题就是区间的并，线段树，用一个数组维护最大区间值为1的长度，另一个数组维护最大区间值为0的长度

最后统计一下就行了