Cod sursa(job #53000)

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

#define NMAX 50010

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

void read()
{
	long long i, x;

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

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

void solve()
{
	long 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)
			{
				dr = j;
				st = i;
				suma = a[j] - a[i-1];
			}
		}
	}
}

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

	read();

	solve();

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

	fclose(stdin);
	fclose(stdout);

	return 0;
}