#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int n;
int a[N],s[N];
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
int res=0;
for(int i=0,j=0;i<n;i++)
{
s[a[i]]++;
while(s[a[i]]>1)
{
s[a[j]]--;
j++;
}
res=max(res,i-j+1);
}
cout<<res<<endl;
return 0;
} 
![[蓝桥杯刷题]合并区间、<span style='color:red;'>最</span><span style='color:red;'>长</span><span style='color:red;'>不</span><span style='color:red;'>连续</span><span style='color:red;'>子</span><span style='color:red;'>序列</span>、<span style='color:red;'>最</span><span style='color:red;'>长</span><span style='color:red;'>不</span><span style='color:red;'>重复</span>数组长度](https://img-blog.csdnimg.cn/direct/beaa160076a845ca8a53e88322adfb3a.gif#pic_center)
