Cod sursa(job #1959541)
Utilizator | Data | 9 aprilie 2017 16:51:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,st,d,s,smax,dmax,stmax,v[6000000];
int main()
{
f>>n;
for (i=1;i<=n;i++) f>>v[i];
st=1;
for (i=1;i<=n;i++)
{
s+=v[i];
if (s>0) d++;
else s=0,st=i+1,d=i;
if (s>smax) smax=s,stmax=st,dmax=d;
}
g<<smax<<' '<<stmax<<' '<<dmax<<'\n';
return 0;
}