Cod sursa(job #1383032)
| Utilizator | Data | 9 martie 2015 20:29:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#define n_max 600002
using namespace std;
ifstream r("ssm.in");
ofstream w("ssm.out");
int n, st, sf, aux, best=-n_max, s, x;
int main() {
r>>n;
for (int i=1; i<=n; i++) {
r>>x;
if (s<0) {
s=x;
aux=i;
}
else
s=s+x;
if (s>best) {
best=s;
st=aux;
sf=i;
}
}
w<<best<<" "<<st<<" "<<sf<<"\n";
r.close();
w.close();
return 0;
}
