Submission #1691482

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,k,a[100010];
ll s[100010];

int main(){
	cin >> n >> k;
	REP(i,0,n) cin >> a[i];
	REP(i,0,n) s[i+1]=a[i]+s[i];
	
	ll sum=0;
	REP(i,0,n-k+1) sum+=s[i+k]-s[i];
	
	cout << sum << endl;
	return 0;
}

Submission Info

Judge Result