cf_332b - Maximum Absurdity

题意，从一个1~n中找到两个连续的k个元素使得a+1+a+2....+a+k+b+1+b+2....b+k最大

从后面数2*k个元素开始，枚举a,b，注意a+k<=b

所以O（N）的时间就可以了。

代码如下：

#include <cstdio>
#define M 200005
int st[M];
long long sum[M], max, maxab;
int main ()
{
    int n, k, a, b;
    scanf("%d %d",&n,&k);
    for(int i = 1; i <= n; i++)
        scanf("%d",&st[i]);
    for(int i = 1; i <= k; i++)sum[1] += st[i];
    for(int i = k+1; i <= n; i++) sum[i-k+1] = sum[i-k]+st[i]-st[i-k];
    max = maxab = 0;
    int preb;
    for(int i = n-2*k+1; i >= 1; i--)
    {
        if(max <= sum[i+k]) { max = sum[i+k]; b = i+k;}
        if(maxab <= max+sum[i]) {maxab = max+sum[i]; a = i; preb = b;}
    }
    printf("%d %d\n",a,preb);
    return 0;
}