import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[100010];
int[] st = new int[100010];
for(int i = 0; i < n;i ++) a[i] = sc.nextInt();
int res = 0;
for(int i = 0, j = 0; i < n; i++){
st[a[i]] ++;
while(j < i && st[a[i]] > 1){
st[a[j]] --;
j ++;
}
res = Math.max(res, i-j+1);
}
System.out.print(res);
}
}
AcWing799. 最长连续不重复子序列 双指针
于 2024-08-11 17:18:37 首次发布