Cod sursa(job #3151329)
Utilizator | Stan Rares RaresStan | Data | 20 septembrie 2023 18:17:34 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int v[6000005];
int main() {
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, s = 0, maxx = 0, poz1 = 0, poz2 = 0;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i < n; i++) {
for (int j = i; j <= n; j++) {
s += v[j];
if (s > maxx) {
maxx = s;
poz1 = i;
poz2 = j;
}
}
}
cout << s << " " << poz1 - 1 << " " << poz2;
return 0;
}