题意:
n个数中选两个长度为k的不连续区间,使两个区间和最大。
题解:
sum数组记录前缀和,sum1数组记录以i为结尾,区间长度为k的区间和,从第2k开始遍历,maxx1维护从0到i-k间最大的区间和,因为从第i-k到i的区间与0到i-k区间无关,所以可maxx2维护这两个区间总和的最大值。
AC代码:
//
//Write by Yuan Xilan on 2019...
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ms(s) memset(s, 0, sizeof(s))
const int inf = 0x3f3f3f3f;
const int maxn = 2e+5+5;
const ll INF = -1e+18;
ll a[maxn],sum[maxn],sum1[maxn];
int main(){
std::ios::sync_with_stdio(false);
int t;
cin >> t;
while(t--){
int n,k;
cin >> n >> k;
for(int i=1; i<=n; ++i) cin >> a[i];
sum[0] = 0;
for(int i=1; i<=n; ++i) sum[i] = sum[i-1] + a[i];
for(int i=k; i<=n; ++i) sum1[i] = sum[i] - sum[i-k];
ll maxx1 = INF;ll maxx2 = INF;
for(int i=k*2; i<=n; ++i){
maxx1 = max(maxx1,sum1[i-k]);
maxx2 = max(maxx2,maxx1+sum1[i]);
}
cout << maxx2 << endl;
}
return 0;
}