Pagini recente » Cod sursa (job #24457) | Cod sursa (job #2475246) | Cod sursa (job #2269290) | Cod sursa (job #2700382) | Cod sursa (job #2910107)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int nmax = 6 * 1e6;
int n, arr[nmax+5], sum, imax, jmax, smax = -1e9;
void Solve() {
int low = 0;
sum = arr[0];
for(int i = 1; i < n; i++) {
if(arr[i] > sum + arr[i])
sum = arr[i], low = i;
else
sum += arr[i];
if(sum > smax)
smax = sum, imax = low, jmax = i;
}
}
int main() {
in >> n;
for(int i = 0; i < n; i++)
in >> arr[i];
Solve();
out << smax << " " << imax + 1 << " " << jmax + 1;
return 0;
}