Cod sursa(job #52980)

Utilizator peanutzAndrei Homorodean peanutz Data 20 aprilie 2007 15:31:31
Problema Secventa 2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.66 kb
#include <stdio.h>

#define NMAX 50010

long a[NMAX];
long n, k;
long st, dr, suma = -25100 * NMAX;

void read()
{
	long i, x;

	scanf("%d %d\n", &n, &k);

	for(i = 1; i <= n; ++i)
	{
		scanf("%ld\n", &x);
		a[i] = a[i-1] + x;
	}
}

void solve()
{
	long i, j;

	for(i = 1; i <= n-k+1; ++i)
	{
		for(j = i+k-1; j <= n; ++j)
		{
			if(a[j]-a[i-1] > suma)
			{
				st = j;
				dr = i;
				suma = a[j] - a[i-1];
			}
		}
	}
}

int main()
{
	freopen("secv.in", "r", stdin);
	freopen("secv.out", "w", stdout);

	read();

	solve();

	printf("%ld %ld %ld\n", st, dr, suma);

	fclose(stdin);
	fclose(stdout);

	return 0;
}