#include <bits/stdc++.h>
#define f0r(i,n) for(int i=0;i<n;i++)
typedef long long int ll; 
using namespace std;
int main() {
    int n, q; cin >> n >> q;
    map<int,int> idx; int mx = 0;
    vector<int> cnt(n, -1);
    while (q--) {
        int a; cin >> a;
        cnt[a] = max(mx, cnt[a]+1);
        mx = cnt[a];
    }
    cout << mx;
    return 0;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |