Cod sursa(job #1979215)
Utilizator | Data | 9 mai 2017 22:50:45 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
long long n, k, i, x, s, p1, p2, poz1, poz2, Max;
int main ()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
scanf("%lld%lld", &n, &k);
scanf("%lld", &x);
s=x;
p1=p2=1;
if (1>=k){
Max=s;
poz1=poz2=1;
}
for (i=2; i<=n; i++){
scanf("%d", &x);
if (s+x>x){
s+=x;
p2=i;
}
else{
s=x;
p1=p2=i;
}
if (s>Max && p2-p1+1>=k){
Max=s;
poz1=p1; poz2=p2;
}
}
printf("%lld %lld %lld", poz1, poz2, Max);
return 0;
}