Pagini recente » Cod sursa (job #313872) | Cod sursa (job #2585370) | Cod sursa (job #1816033) | Cod sursa (job #1025469) | Cod sursa (job #3228766)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int sir[6000001];
int main() {
int n;
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> sir[i];
}
int bestSum = -2000000000, bestBegin, bestEnd;
int sum = 0, currentBegin = 1;
for (int i = 1; i <= n; ++i) {
if (sum < 0) {
sum = sir[i];
currentBegin = i;
}
else {
sum += sir[i];
}
if (sum > bestSum) {
bestEnd = i;
bestSum = sum;
bestBegin = currentBegin;
}
}
fout << bestSum << ' ' << bestBegin << ' ' << bestEnd << '\n';
return 0;
}