Cod sursa(job #577447)
| Utilizator | Data | 10 aprilie 2011 12:03:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
long long int n,i,j,v[100],m[100][100],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;
}
