/*
ID: cm750621
LANG: C++
PROG: milk2
*/
#include <stdio.h>
#include <memory.h>
int main()
{
int n,i,a,b,j,m1=1000000,m2=0,max[2]={0,0};
char hash[1000000];
freopen("milk2.in","r",stdin);
freopen("milk2.out","w",stdout);
memset(hash,0,sizeof hash);
scanf("%d",&n);
for (i=0;i<n;++i)
{
scanf("%d%d",&a,&b);
--b;
if (a<m1) m1=a;
if (b>m2) m2=b;
for (j=a;j<=b;++j) hash[j]=1;
}
for (i=m1;i<m2;i+=j)
{
for (j=0;hash[i+j]==hash[i];++j);
if (j>max[hash[i]]) max[hash[i]]=j;
}
printf("%d %d\n",max[1],max[0]);
return 0;
}
usaco 1.2.1 milk2
最新推荐文章于 2022-03-06 11:08:18 发布