Pagini recente » Cod sursa (job #2627446) | Cod sursa (job #433646) | Cod sursa (job #1862782) | Cod sursa (job #1783000) | Cod sursa (job #2394435)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f ( "ssm.in" );
ofstream g ( "ssm.out" );
int n, v[6000006];
int main()
{
f>>n;
for(int i = 1; i <= n; ++i)
f >> v[i];
long long maxsum = v[1], st = 1, dr = 1;
long long currentsum = v[1], st2 = 1;
for(int i = 2; i <= n; ++i)
{
if(currentsum + v[i] <= v[i])
st2 = i, currentsum = v[i];
else
currentsum += v[i];
if(currentsum > maxsum)
st = st2, dr = i, maxsum = currentsum;
}
g << maxsum << " " << st << " " << dr << '\n';
return 0;
}