Cod sursa(job #2200038)
| Utilizator | Data | 30 aprilie 2018 09:43:30 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[1000],smax,s,i,n,inc=1,incbest=1,sf=1;
int main()
{
in>>n;
for (i=1;i<=n;++i) in>>v[i];
s=smax=v[1];
for (i=2;i<=n;++i)
{
if (s<0) s=v[i],inc=sf=i;
else s+=v[i];
if (s>smax) smax=s,sf=i,incbest=inc;
}
cout<<smax<<" "<<incbest<<" "<<sf;
return 0;
}
