Cod sursa(job #2610818)
| Utilizator | Data | 5 mai 2020 18:18:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string file="ssm";
ifstream fin(file+".in");
ofstream fout(file+".out");
int n, x;
int now, start, bestSum = INT_MIN, p, u;
int main() {
fin >> n;
p = u = INT_MAX;
for (int i = 1; i <= n; i++) {
fin >> x;
if (now < 0)
now = x, start = i;
else
now += x;
if (bestSum < now) {
bestSum = now;
p = start;
u = i;
}
}
fout << bestSum << " " << p << " " << u;
return 0;
}
