Pagini recente » Cod sursa (job #1119801) | Borderou de evaluare (job #2506502) | Cod sursa (job #1802559) | Borderou de evaluare (job #1055963) | Cod sursa (job #2609756)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, v[6000005];
int main() {
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
int maxSum = - 1 << 31, sum = 0, beg, endi, index;
for (int i = 1; i <= n; i++) {
if (sum < 0) {
sum = v[i];
index = i;
}
else
sum += v[i];
if (sum > maxSum) {
maxSum = sum;
beg = index;
endi = i;
}
}
fout << maxSum << ' ' << beg << ' ' << endi;
return 0;
}