Cod sursa(job #717987)

Utilizator Kira96Denis Mita Kira96 Data 20 martie 2012 13:16:53
Problema Subsecventa de suma maxima Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include<stdio.h>
int min,n,i,j,v[6000100],S[6000100],tot,max,j1,i1,j2,lenght;
int main ()
{
	freopen("ssm.in","r",stdin);
	freopen("ssm.out","w",stdout);
	min=9999999;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&v[i]);
		S[i]=S[i-1]+v[i];
	}
	max=-99999999;
	for(i=1;i<=n;i++)
	{
		min=0;
		for(j=1;j<=i-1;j++)
		if(S[j]<min)
		{
			min=S[j];
			j1=j;
		}
		tot=S[i]-min;
		if(tot>max)
		{
			i1=i;
			j2=j1;
			max=tot;
			lenght=i1-j1;
		}
		else
		if(tot==max&&i-j1>lenght)
		{
			j2=j1; i1-i;
		}
	}
	printf("%d %d %d",max,j2+1,i1);
	return 0;
}