二次聯(lián)通門 : BZOJ 2456 : mode

?

?

?

/*BZOJ 2456 mode額。。。神奇的題。。。每次讀入一個數(shù)不同則抵消相同則計數(shù)器加1。。。最后上下的數(shù)一定是眾數(shù)好吧我語文差。。 */ #include <cstdio>#define INF 1e7void read (int &now) {now = 0;register char word = getchar ();bool flag = false;while (word < '0' || word > '9'){if (word == '-')flag = true;word = getchar ();}while (word <= '9' && word >= '0'){now = now * 10 + word - '0';word = getchar ();}if (flag)now = -now; }int N; int Count;int main (int argc, char *argv[]) {read (N);Count = 0;int Answer = INF;int x;for (int i = 1; i <= N; i++){read (x);if (Answer != x){Count--;if (Count <= 0){Count = 1;Answer = x;}}elseCount++;}printf ("%d", Answer);return 0; }

?

轉載于:https://www.cnblogs.com/ZlycerQan/p/6838094.html

總結

以上是生活随笔為你收集整理的BZOJ 2456 : mode的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。