Cod sursa(job #577452)
| Utilizator | Data | 10 aprilie 2011 12:05:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#define Nmax 6000
#define nmax 6000000
using namespace std;
long long int n,i,j,v[nmax],m[Nmax][Nmax],ma=0,i1,i2;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
for(i=1;i<=n;++i)
{
m[i][i]=v[i];
for(j=i;j<=n;++j)
m[i][j]=m[i][j-1]+v[j];
}
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
if(m[i][j]>ma)
{
ma=m[i][j];
i1=i;
i2=j;
}
}
fout<<ma<<" "<<i1<<" "<<i2;
}
