playlist_1141.cpp (401B)
1 #include <algorithm> 2 #include <iostream> 3 #include <map> 4 #include <vector> 5 6 int main() { 7 size_t n; 8 std::cin >> n; 9 std::vector<int> v(n); 10 for (size_t i = 0; i < n; i++) 11 std::cin >> v[i]; 12 13 size_t l{0}, s{0}; 14 std::map<int, size_t> m; 15 for (size_t r = 0; r < n; r++) { 16 if (m.contains(v[r])) 17 l = std::max(l, m.at(v[r])+1); 18 m[v[r]] = r; 19 s = std::max(s, r-l+1); 20 } 21 std::cout << s << "\n"; 22 }