Cod sursa(job #2054833)
| Utilizator | Data | 2 noiembrie 2017 16:32:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000005],i,j,d,dm,m,s,o,u,sm,smi;
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>m;
s+=m;
if (s>sm)
{
sm=s;
o=i;
}
v[i]=s;
}
smi=v[1];
for (i=1;i<o;i++)
{
if (v[i]<smi)
{
smi=v[i];
u=i;
}
}
fout<<sm-smi<<" "<<u+1<<" "<<o;;
return 0;
}
