Cod sursa(job #261691)

Utilizator GavrilaVladGavrila Vlad GavrilaVlad Data 18 februarie 2009 18:07:00
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <stdio.h>                

long n, i, j, k, s[6001000], b[6001000], st[6001000], sol, in, sf;

int main()
{
	freopen("ssm.in", "r", stdin);
	freopen("ssm.out", "w", stdout);
	sol=-2000000000;
	scanf("%ld\n", &n);
	for(i=1; i<=n; i++)
	{
		scanf("%ld", &s[i]);
		b[i]=s[i];
		st[i]=i;
		if(b[i]<b[i-1]+s[i])
		{
			b[i]=b[i-1]+s[i];
			st[i]=st[i-1];
		}
		if(sol<b[i])
		{
			sol=b[i];
			in=st[i];
			sf=i;
		}
	}
	printf("%ld %ld %ld\n", sol, in, sf);
	return 0;
}