StarryCoding-36:最长连续不重复子序列(C++语言实现)

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+9;
ll a[N],c[N];
void func(){
    
	int n;cin >> n;
    
    for (int i = 1; i < n + 1; ++i) cin >> a[i];
    
    int len = 0;
    for (int i = 1, j = 0; i < n + 1; ++i) {
    	while( j < n && !c[a[j+1]]) c[a[++j]]++;
        len = max(len,j-i+1);
        c[a[i]]--;
    }
    cout << len << '\n';
}
int main(){
	ios::sync_with_stdio(0),cout.tie(0),cin.tie(0);
    int T;cin >> T;
    while(T--) {
    	func();
    }
    return 0;
}

https://www.starrycoding.com/problem/36

给e哥引个流