Cod sursa(job #1494435)
Utilizator | Data | 1 octombrie 2015 08:19:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,i,smax,s,st,dr,p,x;
fin>>n;
fin>>x;
smax=s=x;
st=dr=1;
p=1;
if(s<0)
{
s=0;
p=2;
}
for(i=2;i<=n;i++)
{
fin>>x;
s+=x;
if(s>smax)
{
smax=s;
st=p;
dr=i;
}
if(s<0)
{
s=0;
p=i+1;
}
}
fout<<smax<<" "<<st<<" "<<dr<<"\n";
fout.close();
return 0;
}