Cod sursa(job #2670428)
| Utilizator | Data | 9 noiembrie 2020 21:16:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n,i,v[60001],smax,x,pos,ok,posok;
fin >>n;
v[0]=0;
for (i=1;i<=n;++i)
{
fin >>v[i];
v[i]=v[i]+v[i-1];
}
ok=0;
posok=0;
smax=-100000;
for (i=1;i<=n;++i)
{
v[i]=v[i]-ok;
if (v[i]>smax)
{
smax=v[i];
x=posok+1;
pos=i;
}
if (v[i]<=0)
{
ok=v[i];
posok=i;
}
}
fout <<smax<<' '<<x<<' '<<pos;
fin.close ();
fout.close ();
return 0;
}
