Submission #3791541

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<queue>

#define ipair pair<int,int>
#define rep(i,n) for(i=0;i<n;i++)

using namespace std;

typedef long long int lli;
typedef vector<int> vi;

int main() {
	lli i, j, k, n, m, l;
	vi a;
	unsigned long long ans;

	cin >> n >> k;
	a.resize(n);

	rep(i, n) {
		cin >> a[i];
	}

	ans = 0;
	rep(i, n) {
		if (i < n / 2) {
			ans += a[i] * min(i + 1, k);
		}
		else {
			ans += a[i] * min(n - i, k);
		}
	}

	cout << ans;

	return 0;
}

Submission Info

Judge Result