Cod sursa(job #418045)
| Utilizator | Data | 15 martie 2010 12:49:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
using namespace std;
int a[6000001],n,sm,i,sc,smax,j,d,k,s;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main ()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>a[i];
}
for (i=1;i<=n;i++)
{
for (j=i+1;j<=n;j++)
{
sc=0;
for (k=i;k<=j;k++)
{
sc+=a[k];
}
if (sc>smax)
{
smax=sc;
s=i;d=j;
}
}
}
fout<<smax<<" "<<s<<" "<<d;
return 0;
}