Pagini recente » Cod sursa (job #835643) | Cod sursa (job #219944) | Cod sursa (job #2361350) | Cod sursa (job #2240789) | Cod sursa (job #1356479)
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
int v[10000];
int main()
{
int n,k,i,j,pr,ul,suma=0,smax=0,lg;
f = fopen("secv2.in","r");
g = fopen("secv2.out","w");
fscanf(f,"%d %d\n",&n,&k);
for (i=1; i<=n; i++)
{
fscanf(f,"%d",&v[i]);
}
for (lg=k; lg<=n; lg++)
{
for (i=1; i<=n-lg+1; i++)
{
suma = 0;
for (j=i; j<=i+lg-1; j++)
{
suma += v[j];
}
if (suma > smax)
{
pr = i; ul = pr+lg-1; smax = suma;
}
}
}
fprintf(g,"%d %d %d",pr,ul,smax);
fclose(f);
fclose(g);
return 0;
}