我写的方法比较笨,用了一个时间轴数组vis,若vis[i]==1,则说明第i~i+1秒之间有牛正在被喂奶,最后统计一下数组上连续1的最大长度和连续0的最大长度就可以。
代码如下:
/*
ID: michael139
LANG: C
PROG: milk2
*/
#include<stdio.h>
#include<string.h>
int vis[1000500];
int main () {
FILE *fin = fopen ("milk2.in", "r");
FILE *fout = fopen ("milk2.out", "w");
int n,i,j,s,e,max1,max2,mins,maxe,flag,left;
while (fscanf(fin,"%d",&n) != EOF) {
max1 = max2 = maxe = 0;
mins = 1000050;
memset(vis,0,sizeof(vis));
for (i=0;i<n;i++) {
fscanf(fin,"%d%d",&s,&e);
for (j=s;j<e;j++) vis[j] = 1;
maxe = (maxe>e)?maxe:e;
mins = (mins<s)?mins:s;
}
left = mins;
flag = 1;
for (i=mins;i<=maxe;i++) {
if ((flag && !vis[i]) || i==maxe) {
max1 = (max1>i-left)?max1:i-left;
flag = 0;
left = i;
} else if ((!flag && vis[i]) || i==maxe) {
max2 = (max2>i-left)?max2:i-left;
flag = 1;
left = i;
}
}
fprintf(fout,"%d %d\n",max1,max2);
}
return 0;
}