Pagini recente » Cod sursa (job #269694) | Cod sursa (job #2917284) | Cod sursa (job #2616921) | Cod sursa (job #2784063) | Cod sursa (job #2851308)
#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_max = -2000000000, min = 0, j, st_max = 0, dr_max = 0, min_sum = long long(1e10);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j < i; j++)
{
if (s[j] < min_sum)
{
min_sum = s[j];
st_max = j + 1;
}
}
if (sum_max < s[i] - min_sum)
{
sum_max = s[i] - min_sum;
dr_max = i;
}
}
out << sum_max << " " << st_max << " " << dr_max;
return 0;
}