Cod sursa(job #298620)

Utilizator szabotamasSzabo Tamas szabotamas Data 6 aprilie 2009 11:37:38
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include<stdio.h>
#include<values.h>
#include<fstream.h>

long  n,i,j,max,maxi,maxj,min,minj;
char t[20000];


int main()
{
	ifstream be ("ssm.in");
		be>>n;
		be>>t[1];
		for(i=2; i<=n; i++)
		{
			be>>t[i];
			t[i]+=t[i-1];
		}
	be.close();
	max=t[1];
	maxi=1;
	maxj=1;
	for(i=2; i<=n; i++)
	{
		min=MAXLONG;
		for (j=1; j<=i; j++)
		{
			if (t[j]<min)
			{
				min=t[j];
				minj=j;
			}
		}
		if ( max< (t[i]-min) )
		{
			max=t[i]-min;
			maxi=i;
			maxj=minj;
		}
	}
	ofstream ki ("ssm.out");
		ki<<max <<" ";
		ki<<(maxj+1) <<" ";
		ki<<maxi <<" ";
	ki.close();
	return 0;
}