Cod sursa(job #342738)
| Utilizator | Data | 23 august 2009 11:55:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
long S[6000001];
int main(void) {
long n;
ifstream in("ssm.in");
in >> n;
for(int i=1; i<=n; i++) in >> S[i];
long bestSum = -int(2e9), sum = 0, beg=0, end=0, idx=0;
for (int i=1; i<=n; i++) {
if (sum < 0)
sum = S[i], idx = i;
else
sum += S[i];
if (bestSum < sum)
bestSum = sum, beg = idx, end = i;
}
ofstream out("ssm.out");
out << bestSum << " " << beg << " " << end;
in.close(), out.close();
return 0;
}
