Submission #1221495

#TimeUsernameProblemLanguageResultExecution timeMemory
1221495gry3125Infinite Race (EGOI24_infiniterace2)C++20
34 / 100
32 ms1096 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...