Cod sursa(job #3131360)
Utilizator | Biclineru Radu Radu_Bicli | Data | 19 mai 2023 22:17:06 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Juniori s4 | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, i, a[50002], sc, s;
int p1, p2, p, r = INT_MIN;
int main() {
fin >> n >> k;
for(i = 1; i <= n; i++) fin >> a[i];
for(i = k; i <= n; i++) {
sc = a[i] - a[i - k + 1];
if(sc <= s + a[i]) s += a[i];
else s = sc, p = i - k + 1;
if(r < s) {
r = s;
p1 = p;
p2 = i;
}
}
fout << p1 << " " << p2 << " " << r;
return 0;
}