Cod sursa(job #1368657)
Utilizator | Data | 2 martie 2015 19:09:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N, st, fn, x, aux;
long long sum, best=-1LL*(1<<30);
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
{
f>>x;
if (sum<0) sum=x, aux=i;
else sum+=x;
if (best<sum)
best=sum, st=aux, fn=i;
}
g<<best<<' '<<st<<' '<<fn<<'\n';
return 0;
}