Pagini recente » Cod sursa (job #1869359) | Cod sursa (job #159784) | Cod sursa (job #48726) | Cod sursa (job #2986288) | Cod sursa (job #3212566)
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int NMAX = 6e6 + 5;
int n, v[NMAX], max1;
int32_t main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
cin >> n;
for(int i = 1; i <= n; i++)
cin >> v[i];
int maxst, maxdr, st = 1, suma = 0;
for(int i = 1; i <= n; i++)
{
suma += v[i];
if(suma < 0)
{
suma = 0;
st = i + 1;
}
else
{
if(suma > max1)
{
max1 = suma;
maxst = st;
maxdr = i;
}
}
}
cout << max1 << " " << maxst << " " << maxdr;
}