Cod sursa(job #1577521)
Utilizator | Maria Pasca mariaiuliap | Data | 23 ianuarie 2016 15:25:14 |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
const int MAXN = 7000005;
int main(void) {
int n, S,i,k;
int bestSum = -int(2e9), sum = 0, beg, end, idx;
cin >> n;
cin>>k;
for(i=1;i<=n;i++) {
cin >> S;
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (bestSum < sum&& i-idx>k)
bestSum = sum, beg = idx, end = i;
}
cout << beg<<" " << end<<" "<<bestSum;
cin.close(), cout.close();
return 0;
}