Submission #1148185

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148185		ghammazhassan	Infinite Race (EGOI24_infiniterace2)	C++20	0 / 100	15 ms	15944 KiB

Main

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n";
const int N=2e5+5;
const int M=1e9+7;
int n , q , x , y , p[N] , cnt[N] , ind[N];
vector<vector<int>>a(N);
vector<int>pr(N);
vector<int>e;
vector<int>l(N);
vector<pair<int,int>>li(N);
void solve()
{
	cin >> n >> q;
	vector<int>mn(n+1);
	vector<int>mx(n+1);
	vector<int>k(n+1);
	int c=1;
	for (int i=0;i<q;i++){
		cin >> x;
		if (x>0){
			k[x]++;
			c=max(c,k[x]);
		}
		else{
			x*=-1;
			k[x]--;
			k[x]=max(k[x],x-x);
			c=max(c,k[x]);
		}
	}
	// for (int i=1;i<n;i++){
	// 	c=max(c,mx[i]);
	// }
	cout << c-1 << endl;
}
signed main()
{
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed<<setprecision(9);
    int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
    	solve();
    }
}
// Fenwick Tree
// Sqrt Decomposition
// Segment Tree

• Subtask 1: 0 / 29
• Subtask 2: 0 / 34
• Subtask 3: 0 / 22
• Subtask 4: 0 / 15