Cod sursa(job #407789)
Utilizator | Flavius Anton f.v.anton | Data | 2 martie 2010 17:21:24 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#define infinit 2000000000
using namespace std;
int main()
{
long bestsum=-infinit,sum=0,idx,beg,end,crt;
fstream f("ssm.in",ios::in);
long n;
f>>n;
for(int i=1;i<=n;i++)
{
f>>crt;
if(sum<0)
{
sum=crt; idx=i;
}
else
sum+=crt;
if(bestsum<sum)
{
bestsum=sum; beg=idx; end=i;
}
}
f.close(); fstream g;
g.open("ssm.out",ios::out);
g<<bestsum<<" "<<beg<<" "<<end;
f.close();
return 0;
}