Cod sursa(job #1095534)
| Utilizator | Data | 31 ianuarie 2014 13:09:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000005],i,n,j,v[6000005],m,b,e;
int main()
{
fin >> n;
m=-16000000;
for (i=1; i<=n; i++)
{
fin >> v[i];
s[i]=s[i-1]+v[i];
}
for (i=1; i<=n; i++)
{
for (j=i; j<=n; j++)
{
if (s[j]-s[i-1]>m)
{
m=s[j]-s[i-1];
b=i;
e=j;
}
}
}
fout << m << " " << b << " " << e;
fin.close();
fout.close();
return 0;
}
