AtCoder_abc267_c

链接

• 点此跳转

思路

预处理前缀和，处理一下偏移量。

代码

// #pragma GCC optimize(3)
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define endl '\n'
#define fi first
#define se second
#define PI acos(-1)
#define LL long long
#define INF 0x3f3f3f3f
#define lowbit(x) (-x&x)
#define PII pair<int, int>
#define ULL unsigned long long
#define PIL pair<int, long long>
#define mem(a, b) memset(a, b, sizeof a)
#define rev(x) reverse(x.begin(), x.end())
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)

using namespace std;

const int N = 2e5 + 10;

int n, m;
LL a[N], sum1[N], sum2[N];

void solve() {
	cin >> n >> m;
	LL ans = -1e18;
	for (int i = 1; i <= n; i ++ ) {
		cin >> a[i];
		sum2[i] = sum2[i - 1] + a[i];
		sum1[i] = sum1[i - 1] + i * a[i];
		if (i > m) {
			ans = max(ans, 
			sum1[i] - sum1[i - m - 1] - (sum2[i] - sum2[i - m - 1]) * (i - m)); 
		} else if (i == m) ans = max(ans, sum1[m]);
	}
	cout << ans << endl;
}

int main() {
	IOS;
	
	solve();
	
	return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61