Pagini recente » Cod sursa (job #595859) | Cod sursa (job #2955874) | Cod sursa (job #2307508) | Cod sursa (job #1054178) | Cod sursa (job #2628698)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int sp[6000001];
int main() {
int n, x;
int result = INT_MIN;
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> x;
sp[i] = sp[i - 1] + x;
}
int start = 0, end = 0;
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++)
if (sp[j] - sp[i - 1] > result) {
result = sp[j] - sp[i - 1];
start = i;
end = j;
} else if (sp[j] - sp[i - 1] == result && j + 1 - i > end + 1 - start) {
start = i;
end = j;
}
fout << result << " " << start << " " << end;
return 0;
}