2018 CCPC Guilin J :Stone Game 思维 + 博弈论

传送门

分析

考虑每一个数能被选择的最大次数
如果$a[i]<a[i-1]\&\&a[i]<a[i+1]$，那么$a[i]$可以减为0
如果$a[i]$大于其中一个，那么可以减为较小值+1
如果$a[i]$大于左右两个数，那么可以减为较大值+1

代码

#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
    char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
    while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N],n;

ll run(){
    ll res = 0;
    for(int i = 1;i <= n;i++){
        int m = -1;
        if(a[i] > a[i - 1]) m = max(a[i - 1],m);
        if(a[i] > a[i + 1]) m = max(a[i + 1],m);
        res += a[i] - m - 1;
        a[i] = m + 1;
    }
    return res;
}

int main() {
    int T;
    read(T);
    int idx = 0;
    while(T--){
        printf("Case %d: ",++idx);
        read(n);
        for(int i = 1;i <= n;i++) read(a[i]);
        a[0] = a[n + 1] = INF;
        ll res = 0;
        while(1){
            ll x = run();
            if(!x) break;
            res += x;
        }
        if(res & 1) puts("Alice");
        else puts("Bob"); 
    }

}