Cod sursa(job #1193744)
| Utilizator | Data | 1 iunie 2014 16:52:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int smaxst=1,smaxdr=1,smax,n,x;
int main()
{ f>>n;
int i,st,s=0;
f>>smax;
for (i=2;i<=n;i++)
{f>>x;
s+=x;
if (s>smax ||(s==smax && smaxdr-smaxst>i-st))
{smax=s;
smaxdr=i;
smaxst=st;
}
if(s<0){
s = 0;
st = i+1;
}
}
g<<smax<<" "<<smaxst<<" "<<smaxdr<<'\n';
f.close();
g.close();
return 0;
}
