Submission #1226348

#TimeUsernameProblemLanguageResultExecution timeMemory
1226348moonni10Infinite Race (EGOI24_infiniterace2)C++20
0 / 100
73 ms14408 KiB
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define AI ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
vector<ll>a;
vector<ll>b;
vector<pair<ll,ll>>ans;
void solve()
{
    ll n,q,i,ma=0;
    cin>>n>>q;
    ll a[q];
    for(i=0;i<q;i++)
    cin>>a[i];
    map<ll,ll>mp;
    for(i=0;i<q;i++)
    {
        if(a[i]<0)
        {
            a[i]=abs(a[i]);
            ma=max(ma,mp[a[i]]-1);
            mp[a[i]]=0;
        }
        else
        mp[a[i]]++,ma=max(ma,mp[a[i]]-1);
    }
    cout<<ma;
}
int main()
{
    AI
    ll t=1;
   // cin>>t;
    while(t--)
    solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...