BZOJ2456: mode 众数卡空间

这题做法就是把不同的数字相互消除

剩下最后的就是众数了

不太清楚这个空间怎么算的。。bits居然会被空间卡掉

/*#include<bits/stdc++.h>#include<stdio.h>#include<algorithm>#include<queue>#include<string.h>#include<iostream>#include<math.h>#include<set>#include<map>#include<vector>#include<iomanip>*/#include<cstdio>using namespace std;#define ll long long#define ull unsigned long long#define pb push_back#define FOR(a) for(int i=1;i<=a;i++)const int inf=0x3f3f3f3f;const ll Linf=9e18;const int maxn=1e6+7; const ll mod=1e9+7;const double eps=1e-6;int n,t,x,tot;int main(){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&x);if(x==t)tot++;else if(!tot){t=x;tot=1;}else{tot--;}}printf("%d\n",t);}