Cod sursa(job #1131471)
Utilizator | Data | 28 februarie 2014 20:19:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int n,i,x,s,sol,pii,pi,pj;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
if(s<0)
{
s=x;
pii=i;
}
else
{
s+=x;
if(s>sol)sol=s,pj=i,pi=pii;
}
}
if(s>sol)sol=s,pj=n,pi=pii;
fout<<sol<<' '<<pi<<' '<<pj;
return 0;
}