Playlist
You are given a playlist of a radio station since its establishment. The playlist has a total of songs.
What is the longest sequence of successive songs where each song is unique?
Input
The first input line contains an integer : the number of songs.
The next line has integers : the id number of each song.
Output
Print the length of the longest sequence of unique songs.
Constraints
Input:
Output:
What is the longest sequence of successive songs where each song is unique?
Input
The first input line contains an integer : the number of songs.
The next line has integers : the id number of each song.
Output
Print the length of the longest sequence of unique songs.
Constraints
Input:
8
1 2 1 3 2 7 4 2
Output:
5
#include <bits/stdc++.h>
using namespace std;
#define int long long int#define F first#define S second#define pb push_back#define si set <int>#define vi vector <int>#define pii pair <int, int>#define vpi vector <pii>#define vpp vector <pair<int, pii>>#define mii map <int, int>#define mpi map <pii, int>#define spi set <pii>#define endl "\n"#define sz(x) ((int) x.size())#define all(p) p.begin(), p.end()#define double long double#define que_max priority_queue <int>#define que_min priority_queue <int, vi, greater<int>>#define bug(...) __f (#__VA_ARGS__, __VA_ARGS__)#define print(a) for(auto x : a) cout << x << " "; cout << endl#define print1(a) for(auto x : a) cout << x.F << " " << x.S << endl#define print2(a,x,y) for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl
inline int power(int a, int b){ int x = 1; while (b) { if (b & 1) x *= a; a *= a; b >>= 1; } return x;}
template <typename Arg1>void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }template <typename Arg1, typename... Args>void __f (const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr (names + 1, ','); cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);}
const int N = 200005;
void solve() {// n is the size of the array// here we will use sliding window to get our answerint n;cin>>n;// vector to store all the elementsvi v(n);for (int i = 0; i < n; i++){ cin>>v[i];}// two pointer st and endint st=0,end=0;// you can use set or map to store unique elementsmap<int,int>m;// ans to store our final answerint ans=0;while(end<n){ // add the v[end] to map m[v[end]]++; // check if the size of map is equal to size of the window if(m.size()==end-st+1)ans=max(ans,end-st+1); // else we will shrink our window and remove elements from the map else{ while(m.size()!=end-st+1){ m[v[st]]--; if(m[v[st]]==0)m.erase(v[st]); st++; } } end++;}
cout<<ans<<endl;
}
int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
clock_t z = clock();
int t = 1;// cin >> t; while (t--) solve();
return 0;}
0 Comments
If you have any doubts/suggestion/any query or want to improve this article, you can comment down below and let me know. Will reply to you soon.