Cod sursa(job #2917547)
Utilizator | Alexandru Benescu AlexandruBenescu | Data | 5 august 2022 16:42:13 |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define L 50005
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int s[L];
int main(){
int n, k, i, mx, mn, x, j, st, dr;
fin >> n >> k;
for (i = 1; i <= n; i++){
fin >> x;
s[i] = s[i - 1] + x;
}
mn = 0;
j = dr = st = 1;
mx = s[1];
for (i = 1; i <= n; i++){
if (s[i] - mn > mx && i - j + 1 >= k){
mx = s[i] - mn;
st = j;
dr = i;
}
if (mn > s[i]){
mn = s[i];
j = i + 1;
}
}
fout << st << " " << dr << " " << mx << "\n";
return 0;
}