Pagini recente » Borderou de evaluare (job #2658045) | Cod sursa (job #2426162) | Cod sursa (job #2397758) | Cod sursa (job #3265559) | Cod sursa (job #2699909)
#include <fstream>
#define int long long
using namespace std;
const int MAXN = 7000005;
int v[MAXN], n;
int32_t main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> v[i];
int st, dr, smax = -int(2e9), s = -1, start;
for (int i = 1; i <= n; ++i)
{
if (s < 0)
s = 0, start = i;
s += v[i];
if (s > smax)
smax = s, st = start, dr = i;
}
cout << smax << " " << st << " " << dr;
return 0;
}