Codeforces 371E Subway Innovation (前缀和预处理应用)

题目链接　Subway Innovation

首先不难想到所求的k个点一定是连续的，那么假设先选最前面的k个点，然后在O(1)内判断第2个点到第k+1个点这k个点哪个更优。

判断的时候用detla[i]来记录信息。令delta[k+1]+delta[k+2]+......+delta[k+x] = sum[x]，则sum[x]最大时，x即为排完序后的要选的k个点的最大的编号。

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i(a); i <= (b); ++i)
#define LL           long long

const int N = ;

struct node{
    LL x, y;
    friend bool operator < (const node &a, const node &b){
        return a.x < b.x;
    }
} a[N];

LL x[N], s[N], delta[N];
LL n, k, p, ss, ans, cnt;

int main(){

    scanf("%lld", &n);
    s[] = ;
    rep(i, , n){
        scanf("%lld", &a[i].x);
        a[i].y = i;
    }

    scanf("%lld", &k);
    sort(a + , a + n + );
    rep(i, , n) x[i] = a[i].x;
    rep(i, , n) s[i] = s[i - ] + x[i];
    int j = ;
    rep(i, k + , n){
        ++j;
        delta[i] = (k - ) * (x[i] + x[j]) -  * (s[i - ] - s[j]);
    }
    cnt = ans = , p = k;
    rep(i, k + , n){
        cnt += delta[i];
        if (ans > cnt){
            ans = cnt;
            p = i;
        }
    }
    rep(i, p - k + , p) printf("%lld\n", a[i].y);
    return ;

}