Cod sursa(job #438087)
Utilizator | Data | 10 aprilie 2010 14:43:34 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n,sc=0,smax=-(1<<30),i,x,pi,pf,pimax,pfmax;
pi=1;
in>>n;
for(i=1;i<=n;++i)
{
in>>x;
if (sc<0)
{
sc=x;
pi=i;
}
else
{
sc=sc+x;
}
if (sc>smax)
{
smax=sc;
pimax=pi;
pfmax=i;
}
}
out<<smax<<" "<<pimax<<" "<<pfmax<<"\n";
//printf("%d %d %d",smax,pimax,pfmax);
return 0;
}