题意
一个长为N的序列,选择其中2个长为K的不相交区间,使两个区间和最大
题解
CF标签上写的好好的DP,做着做着发现就是前缀和思想嘛,哪里有DP?哪里有DP?
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=2e5;
LL sum[maxn+5];
LL premax[maxn+5];
int pre_id[maxn+5];
int arr[maxn+5];
int main(void)
{
#ifdef ex
freopen ("in.txt","r",stdin);
#endif
int n,k;
scanf("%d%d",&n,&k);
sum[0]=0;
for (int i=1;i<=n;++i)
{
scanf("%d",&arr[i]);
sum[i]=sum[i-1]+arr[i];
}
premax[k]=sum[k];
pre_id[k]=1;
for (int i=k+1;i<=n;++i)
{
if (sum[i]-sum[i-k]>premax[i-1])
{
pre_id[i]=i-k+1;
premax[i]=sum[i]-sum[i-k];
}
else
{
pre_id[i]=pre_id[i-1];
premax[i]=premax[i-1];
}
}
LL tmax=sum[2*k];
int a=1;
int b=k+1;
for (int i=2*k+1;i<=n;++i)
{
if (sum[i]-sum[i-k]+premax[i-k]>tmax)
{
tmax=sum[i]-sum[i-k]+premax[i-k];
a=pre_id[i-k];
b=i-k+1;
}
}
printf("%d %d\n",a,b);
}