到天宫做客(2017寒假培训测试压轴题)

2
3 8
12 2

63266

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int a[10001];
int month[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int main()
{
    int tot;
    int n;
    int x,y;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
    tot=0;
    scanf("%d%d",&x,&y);//3 8    12 2
    for(int j=1;j<x;j++)
    {
        tot=month[j]+tot;
    }
    tot=tot+y;
    a[tot]=1;
    }
    double le=0;
    double l=0;
    for(int i=1;i<=366;i++)
    {
        if(a[i]==1)
        {
            le=max(l,le);
            l=0;
        }
        else l++;
        if(i==366)le=max(l,le);
        
    }
    double ans;
    ans=double((le)/366)*3600*24;
    cout<<int(ans+0.5);
    return 0;
}