Submission #1351333

#TimeUsernameProblemLanguageResultExecution timeMemory
1351333trigonInfinite Race (EGOI24_infiniterace2)C++20
0 / 100
0 ms344 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    vector<int> ahead(n,true);
    int q;
    cin >> q;
    vector<int> ans(n,0);
    int state=0;
    while(q--){
        int x;
        cin >> x;
        if(x>0){
            if(ahead[x]==true) ans[x]++;
            ahead[x]=true;        
        }
        else{
            ahead[-x]=false;
        }
    }
    int res=0;
    for(int i=0;i<n;i++){
        res=max(ans[i],res);
    }
    cout<<res<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...