playlist.cpp

#include <bits/stdc++.h>
#define f first
#define s second
#define endl "\n"

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}

int N;
int k[200000];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> N;
    for(int i = 0; i < N; i++){
        cin >> k[i];
    }
    int ans = 0;
    set<int> curr;
    int beg = 0, end = 0;
    while(end < N){
        while(curr.find(k[end]) != curr.end()){
            curr.erase(k[beg]);
            beg++;
        }
        curr.insert(k[end]);
        ans = max(ans, end - beg + 1);
        end++;
    }
    cout << ans << endl;
    return 0;
}