Cod sursa(job #2285759)
| Utilizator | Data | 19 noiembrie 2018 09:58:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000005];
int main()
{
int n,st=1,dr=1,s,smax,stmax=1,drmax=1;
in>>n;
for(int i=1;i<=n;i++)
{
in>>v[i];
}
smax=v[1];
s=smax;
for(int i=2;i<=n;i++)
{
if(s+v[i]>=v[i])
{
dr++;
s+=v[i];
}
else
{
st=i;
dr=i;
s=v[i];
}
if(s>smax)
{
smax=s;
stmax=st;
drmax=dr;
}
}
out<<smax<<" "<<stmax<<" "<<drmax;
}
