Cod sursa(job #849417)
Utilizator | Data | 6 ianuarie 2013 21:35:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long N,beg,end,idx;
long long sum,best,V[600002];
int main()
{
f>>N;
idx=1;
for (long i=1;i<=N;i++)
{ f>>V[i];
if (sum<0)
{sum=V[i];idx=i;}
else
sum+=V[i];
if(sum>best)
{
best=sum;
end=i;
beg=idx;
}
}
g<<best;
return 0;
}