Cod sursa(job #348031)
Utilizator | Prodan Diana prdiana | Data | 13 septembrie 2009 20:26:18 |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <stdio.h>
#define INF 99999999
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
int n,k,i,st = 1,bend,bst,nr,end,best = -INF,max = -INF;
scanf("%d%d",&n,&k);
for (i=0;i<n;i++)
{
scanf("%d",&nr);
if (best+nr<nr)
{
best = nr;
st = i+1;
end = i;
}
else
{
best+=nr;
end = i+1;
if (end-st>=k && best>max)
{
max = best;
bend = end;
bst = st;
}
}
}
printf("%d %d %d",bst,bend,max);
return 0;
}