Cod sursa(job #1154784)
| Utilizator | Data | 26 martie 2014 13:21:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,aux,i,s,smax,st,sf,stmax,sfmax;
int main()
{
fin>>n;
st=1;
smax=(-1)*1<<30;
for(i=1;i<=n;++i)
{
fin>>aux;
if(aux>s+aux)
{
if(s>smax)
{
s=smax;
stmax=st;
sfmax=i-1;
}
st=i;
s=aux;
}
else
{
s+=aux;
if(s>smax)
{
smax=s;
stmax=st;
sfmax=i;
}
}
}
fout<<smax<<" "<<stmax<<" "<<sfmax<<'\n';
return 0;
}
