Cod sursa(job #482938)
Utilizator | Data | 6 septembrie 2010 11:21:47 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<stdio.h>
long n,k,i,j,max,o,u,s,v[1001];
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%ld%ld",&n,&k);
for (i=1;i<=n;i++)
scanf("%ld",&v[i]);
for (i=k;i<=n;++i)
{
s=v[i];
for (j=i+1;j<=n;++j)
{
s=s+v[j];
if (s>max)
{
max=s;
o=i;
u=j;
}
}
}
printf("%ld %ld %ld",o,u,max);
}