Cod sursa(job #1789193)
| Utilizator | Data | 26 octombrie 2016 19:25:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,i,x[6000001],S,st,dr,Smax;
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>x[i];
}
st=1;
S=x[1];
dr=1;
Smax=S;
for (i=2;i<=n;i++)
{
if (S+x[i]>x[i])
{
S+=x[i];
}
else
{
st=i;
S=x[i];
}
if (S>Smax)
{
Smax=S;
dr=i;
}
}
fout<<Smax<<" "<<st<<" "<<dr;
return 0;
}
