Cod sursa(job #277600)
Utilizator | Data | 11 martie 2009 20:04:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
#include<math.h>
ifstream f("ssm.in");
ofstream g("ssm.out");
int main ()
{
long a[20000],n,i,j,k,ind1,ind2,max;
f>>n;
for (i=1; i<=n; i++)
f>>a[i];
max=0;
for (i=1; i<n; i++)
for (j=1; j<=n; j++)
{
s=0;
for (k=i; k<=j; k++)
s+=a[k];
if (s>max) { max=s; ind1=i; ind2=j; }
}
g<<max<<" "<<ind1<<" "<<ind2;
}