Cod sursa(job #2612051)
Utilizator | Hosu Iulia Iulia25 | Data | 8 mai 2020 13:37:32 |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int n, x, k, Min, Max = -2e9, poz, st, dr;
int sp[50005];
int main() {
fin >> n >> k;
for (int i = 1; i <= n; ++i) {
fin >> x;
sp[i] = sp[i - 1] + x;
if (i < k)
continue;
if (i >= k && Min > sp[i - k])
poz = i - k, Min = sp[i - k];
if (Max < sp[i] - Min) {
Max = sp[i] - Min;
st = poz + 1, dr = i;
}
}
fout << st << ' ' << dr << ' ' << Max;
return 0;
}