Cod sursa(job #1638208)
Utilizator | Data | 7 martie 2016 21:50:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,S,st,dr,idx;
int bestSum=-(1<<30);
int main()
{
int x;
fin>>n;
for (int i=1; i<=n; ++i)
{
fin>>x;
if (S<0) {
S=x;
idx=i;
}
else S+=x;
if (S>bestSum) { bestSum=S; st=idx; dr=i; }
}
fout<<bestSum<<' '<<st<<' '<<dr;
return 0;
}