Submission #2121224

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
#define MOD (1000000007ll)

bool conccomp(int x, int y, int p, int q){
	return (p*y>x*q);
}

int main(void){
	int k,n,i;
	ll a[123456],t[123456],ans=0ll;
	fill(t,t+123456,0ll);
	cin >> n >> k;
	for(i=0; i<n; ++i){
		cin >> a[i];
	}
	for(i=0; i<n; ++i){
		if(i+k>n){
			break;
		}
		t[i]++;
		t[i+k]--;
	}
	for(i=1; i<n; ++i){
		t[i] += t[i-1];
	}
	for(i=0; i<n; ++i){
		ans += (a[i]*t[i]);
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result