Cod sursa(job #901259)
Utilizator | Data | 1 martie 2013 09:11:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int s ,sc=0 ,x ,smax=-1000000000 , ind1 ,ind2 ,n ,i, inc;
in>>n;
for(i=1;i<=n;i++)
{
in>>x;
if(sc<0)
{
sc=x;
inc=i;
}
else
{
sc=sc+x;
}
if(sc>smax)
{
smax=sc;
ind1 = inc;
ind2=i;
}
}
out<<smax<<" "<<ind1<<" "<<ind2;
return 0;
}