Mai intai trebuie sa te autentifici.
Cod sursa(job #2971100)
| Utilizator | Data | 26 ianuarie 2023 16:37:34 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
const int MAX_LENGTH = 6000000;
int n, a[MAX_LENGTH + 1];
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> a[i];
}
for (int i = 1; i <= n; ++i) {
for (int j = n; j >= i; --j) {
int sum = 0;
for (int k = i; k <= j; ++k) {
sum += a[k];
}
if (sum > maxim) {
maxim = sum;
i1 = i;
i2 = j;
}
}
}
fout << maxim << " " << i1 << " " << i2;
return 0;
}
