Cod sursa(job #2566517)
| Utilizator | Data | 2 martie 2020 21:46:01 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int v, n, i, i1, i2, i1p, k;
long long sum, ssm;
int main(){
fin >> n >> k;
ssm = LLONG_MIN;
sum = LLONG_MAX;
for (i=1; i<=n; i++){
fin >> v;
if (sum < 0){
sum = v;
i1p = i;
}
else{
sum += v;
}
if (sum > ssm && i - i1p + 1 >= k){
ssm = sum;
i1 = i1p;
i2 = i;
}
}
fout << i1 << " " << i2 << " " << ssm;
return 0;
}
