Cod sursa(job #1778658)
Utilizator | Data | 13 octombrie 2016 22:55:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s,smax,st,stmax,drmax,a,i;
s=smax=-2000000000;
fin>>n;
for (int i=1; i<=n;i++)
{
fin>>a;
if (s<0)
{
s=a;
st=i;
}
else
s=s+a;
if (s>smax)
{
smax=s;
stmax=st;
drmax=i;
}
}
fout<<smax<<" "<<stmax<<" "<<drmax;
return 0;
}