Pagini recente » Cod sursa (job #2918025) | Cod sursa (job #2734058) | Cod sursa (job #1587156) | Cod sursa (job #1789178) | Cod sursa (job #2964513)
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf = 1e16;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int32_t main()
{
cin.tie(nullptr)->sync_with_stdio(false);
int n;
fin >> n;
int dp[n + 1], unde[n + 1];
for (int i = 1; i <= n; ++i)
{
int x;
fin >> x;
dp[i] = x;
unde[i] = i;
if (i == 1)
continue;
if (dp[i - 1] >= 0)
{
dp[i] += dp[i - 1];
unde[i] = unde[i - 1];
}
}
int ans = -inf;
pair<int, int> secv;
for (int i = 1; i <= n; ++i)
{
if (dp[i] > ans)
{
ans = dp[i];
secv = {unde[i], i};
}
}
fout << ans << ' ' << secv.first << ' ' << secv.second;
}