版权声明:未经过同意不得转载 https://blog.csdn.net/qq_42500298/article/details/88902386
直接暴力枚举每次选的序号
#include<bits/stdc++.h>
using namespace std;
const int maxn=100005;
int A[maxn],B[maxn];
int n;
pair<int,int> ans;
void check(int type)
{
int len=0;
for(int i=1;i<=n;i++)
{
if(A[i]==type||B[i]==type)
len++;
else
len=0;
ans=max(ans,make_pair(len,-type));
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>A[i]>>B[i];
for(int i=1;i<=5;i++)
check(i);
cout<<ans.first<<" "<<-ans.second<<endl;
return 0;
}