题解 | 空间跃迁

#include <climits>
#include<iostream>
#include<vector>
using namespace std;
#define int long long
signed main(){
    int n,k;cin>>n>>k;
    vector<int>met(n);
    vector<int>prefix(n+1,0);
    for(int i=0;i<n;i++){
        cin>>met[i];
        prefix[i + 1] = prefix[i] + met[i];
    }
    int max=LLONG_MIN;
    for(int i=0;i<=n-k;i++){
        int current = prefix[i+k]-prefix[i];
        if(max<current)max=current;
    }
    cout<<prefix[n]-max<<endl;
    return 0;
}
// 64 位输出请用 printf("%lld")