Cod sursa(job #2279494)
| Utilizator | Data | 9 noiembrie 2018 17:03:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int x[6000005];
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n,i,s,smax,ic,im,sfm;
in>>n;
for(i=1;i<=n;i++)
in>>x[i];
s=smax=x[1];
ic=im=sfm=1;
for(i=2;i<=n;i++)
{
if(s+x[i]>=x[i])
s=s+x[i];
else
{
s=x[i];
ic=i;
}
if(s>smax)
{
smax=s;
im=ic;
sfm=i;
}
}
out<<smax<<" "<<im<<" "<<sfm;
return 0;
}
