Cod sursa(job #2199093)
Utilizator | Data | 26 aprilie 2018 17:39:58 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define NMAX 50005
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, v[NMAX], sol=INT_MIN, st, dr;
int main()
{
int i, j, s=INT_MIN;
fin>>n>>k;
for(i=1; i<=n; i++) fin>>v[i];
for(i=1; i<=n; i++) {
(s<0 ? (s=v[i], j=i) : s+=v[i]);
if(s>sol && i-j>k) sol=s, st=j, dr=i;
}
fout<<st<<' '<<dr<<' '<<sol;
return 0;
}