baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-24 07:48:50 +00:00
Code Releases Activity

AT2412 [JOI 2007 Final]最大の和

Browse Source 
R44429693
This commit is contained in:
Baoshuo Ren 2020-12-30 18:25:28 +08:00 committed by Baoshuo Ren
parent e78eb6db61
commit e1bb425d87
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 18 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
problem/AT2412/AT2412.cpp Normal file
View File

@ -0,0 +1,18 @@
#include <bits/stdc++.h>
using namespace std;
int n, k, ans, a[100005], f[100005];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
f[i] = f[i - 1] + a[i];
}
for (int i = k; i <= n; i++) {
ans = max(ans, f[i] - f[i - k]);
}
cout << ans << endl;
return 0;
}