Cod sursa(job #1414109)
Utilizator | Data | 2 aprilie 2015 13:03:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N, x, aux, start, fin;
long long sum, best=-(1LL<<60);
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
{
f>>x;
if (sum<0) sum=x, aux=i;
else sum+=x;
if (sum>best)
best=sum, fin=i, start=aux;
}
g<<best<<' '<<start<<' '<<fin<<'\n';
return 0;
}