题目描述
分析
好题哇
首先我们定义数组f[n][3];
f[i][1]表示srf从第i + 1个数字开始时的最优策略,f[i][2]表示qtc从第i + 1个数字时的最优策略,均表示最终得分
如果当前是srf选,那么表明qtc在i + 1~i + m中已经选过一个数字了,根据最优性判断最后结果一定是最小的,所以我们需要找到最小的那个,然后+a[i],反之则是找最大的
用优先队列或者线段树维护一下最值,优化掉一重循环即可
代码
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstring>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const int N = 200010;
ll a[N];
ll f[N][3];
int q1[N],hh1,tt1;
int q2[N],hh2,tt2;
ll s1[N],s2[N];
int n,m;
void push1(ll x,int i){
while (hh1 <= tt1 && s1[tt1] >= x) --tt1;
s1[++tt1] = x,q1[tt1] = i;
}
void push2(ll x,int i){
while (hh2 <= tt2 && s2[tt2] <= x) --tt2;
s2[++tt2] = x,q2[tt2] = i;
}
void pop1(int i) {while (q1[hh1] >= i) ++hh1;}
void pop2(int i) {while (q2[hh2] >= i) ++hh2;}
int main(){
scanf("%d%d",&n,&m);
for(int i = 1;i <= n;i++) scanf("%lld",&a[i]);
hh1 = 0,tt1 = -1;
hh2 = 0,tt2 = -1;
push1(-a[n],n);
push2(a[n],n);
for(int i = n - 1;~i;i--){
f[i][1] = s2[hh2];
f[i][2] = s1[hh1];
pop1(i + m);
pop2(i + m);
push1(f[i][1] - a[i],i);
push2(f[i][2] + a[i],i);
}
printf("%lld\n",f[0][1]);
printf("%lld\n",f[0][2]);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/