Editorial for Codeforces Round #748 (Div.3)
Editorial for Codeforces Round #748 (Div.3)
1593A - Elections
解法：模拟
**时间复杂度 O(1), 空间复杂度 O(1)
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 4E5 + 5;
void solve() {
