제출 #1240750

#제출 시각아이디문제언어결과실행 시간메모리
1240750aren_danceInfinite Race (EGOI24_infiniterace2)C++20
29 / 100
32 ms580 KiB
#include <bits/stdc++.h>
using namespace std;
const int N=5e5;
int a[N];
bool fl[N];
int main()
{
    int n,k;
    cin>>n>>k;
    int answ=0;
    while(k--){
        int x;
        cin>>x;
        if(x<0){
            fl[-x]=0;
            continue;
        }
        if(fl[x]==0){
            fl[x]=1;
            continue;
        }
        a[x]++;
    }
    for(int i=1;i<=n;++i){
        answ=max(answ,a[i]);
    }
    cout<<answ;
    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...