Pagini recente » Cod sursa (job #2955187) | Cod sursa (job #2380724) | Cod sursa (job #2536666) | Cod sursa (job #488402) | Cod sursa (job #2851310)
#include <fstream>
using namespace std;
const int N= 7000005;
int s[N], n, x;
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
in >> n;
for (int i = 1; i <= n; i++)
{
in >> x;
s[i] = s[i - 1] + x;
}
in.close();
long long sum_min = -int(2e9), min = 0, j, st_max = 0, dr_max = 0, min_sum = (long long)1e10;
for (int i = 1; i <= n; i++)
{
s[i] += s[i - 1];
if (sum_min < s[i] - min)
{
sum_min = s[i] - min;
st_max = j + i;
dr_max = i;
}
if (min > s[i])
{
min = s[i];
j = i;
}
}
out << sum_min << " " << st_max << " " << dr_max;
out.close();
return 0;
}