2018.8.24T2(dp)

题目大意：
两个人轮流取一个序列的值，每次只能从上次选取的数后面的 m m <script type="math/tex" id="MathJax-Element-13">m</script>个里面选

---

做法是一个dp，每次从前面的最大值里面取

#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define P pair<int,int>
#define pb push_back
#define pc putchar
#define mp make_pair
#define file(k) memset(k,0,sizeof(k));
#define ll long long
const ll INF = 1e16; 
ll dp[1010000];
ll a[1010000];
int n , m;
int q[1010000];
int head , tail;
ll read()
{
    ll sum = 0;char c = getchar();bool flag = true;
    while(c < '0' || c > '9') {if(c == '-') flag = false;c = getchar();}
    while(c >= '0' && c <= '9') sum = sum * 10 + c - 48 , c = getchar();
    if(!flag) sum = -sum;
    return sum;
} 
int main()
{
    freopen("game.in","r",stdin);
    freopen("game.out","w",stdout);
    n = read();m = read();
    repp(i,n,1) a[i] = read();
    dp[1] = a[1];
    head = tail = 1;q[1] = 1;
    rep(i,2,n)
    {
        if(head <= tail && i - q[head] > m) head++;
        dp[i] = a[i] - dp[q[head]];
        while(head <= tail && dp[i] > dp[q[tail]]) tail--;
        q[++tail] = i;
    }
    ll ans = -INF;
    rep(i,1,m) ans = max(ans,dp[n-i+1]);
    printf("%lld %lld\n",ans,-ans);
    return 0;
}