Cod sursa(job #3127742)
Utilizator | Biclineru Radu Radu_Bicli | Data | 7 mai 2023 19:31:42 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, i, p1, p2, scur;
int a[50002], s, p, y, r;
int main() {
fin >> n >> k;
for(i = 1; i <= k; i++) {
fin >> a[i];
scur += a[i];
}
r = s = scur;
p1 = 1;
p = 1;
p2 = k;
for(i = k + 1; i <= n; i++) {
fin >> a[i];
scur += a[i] - a[i - k];
if(scur <= s + a[i]) s += a[i];
else {
s = scur;
p = i - k + 1;
}
if(s > r) {
r = s;
p1 = p;
p2 = i;
}
}
fout << p1 << " " << p2 << " " << r;
return 0;
}