Pagini recente » Cod sursa (job #253587) | Cod sursa (job #2543695) | Cod sursa (job #138898) | Cod sursa (job #2882471) | Cod sursa (job #2978745)
#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <stack>
#include <iomanip>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
long long n;
fin >> n;
long long sum = 0, maxSum = INT16_MIN;
long long startIndex = 0, endIndex = 0, index = 0;
for (int i = 0; i < n; ++i) {
int number;
fin >> number;
if (INT16_MIN == maxSum) {
maxSum = number;
}
if (sum < 0) {
sum = 0;
startIndex = i;
}
sum += number;
if (maxSum < sum) {
maxSum = sum;
index = startIndex;
endIndex = i;
}
}
fout << maxSum << " " << index + 1 << " " << endIndex + 1;
return 0;
}