https://www.luogu.com.cn/problem/P1178

#include<bits/stdc++.h>
using namespace std;
int n,zhui,da[13]={31,29,31,30,31,30,31,31,30,31,30,31},maxn=-1;
struct day{
	int m,d;
}q[400]; 
int cha(int s1,int s2,int e1,int e2){
	int ans=0;
	ans=da[s1]-s2+e2;
	for(int i=s1+1;i<e1;i++) ans+=da[i];
	return ans-1; 
}
bool cmp(day a,day b){
	if(a.m==b.m) return a.d<b.d;
	return a.m<b.m;
}
int main(){
	cin>>n;
	if(n==0){
		cout<<24*3600;
		return 0;
	}
	if(n==366){
		cout<<0;
		return 0;
	}
	for(int i=1;i<=n;i++) cin>>q[i].m>>q[i].d;
	sort(q+1,q+1+n,cmp);
	for(int i=2;i<=n;i++){
		zhui=cha(q[i-1].m,q[i-1].d,q[i].m,q[i].d);
		if(zhui>maxn) maxn=zhui;
	}
	cout<<fixed<<setprecision(0)<<86400*maxn*1.0/366;
	return 0;
}

40分wa 6个点求条