Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <unordered_map>
- #include <unordered_set>
- using namespace std;
- int n,M[1000001];
- int main()
- {
- cin>>n;
- for(int i=0;i<n;++i)
- cin>>M[i];
- size_t sol=0;
- unordered_set<int> U;
- for(int i=0;i<n;++i)
- {
- while(U.find(M[i])!=U.end())
- U.erase(M[i-U.size()]);
- U.insert(M[i]);
- if(U.size()>sol)
- sol=U.size();
- }
- cout<<sol;
- return 0;
- }
Add Comment
Please, Sign In to add comment