Pagini recente » Cod sursa (job #691357) | Cod sursa (job #2848958) | Cod sursa (job #1726272) | Cod sursa (job #2716857) | Cod sursa (job #2358931)
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define enter cout << '\n'
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <pii> vii;
typedef vector <ll> vl;
typedef vector <pll> vll;
typedef queue <int> qi;
typedef queue <pii> qii;
typedef queue <ll> ql;
typedef queue <pll> qll;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 9;
const double EPSILON = 1e-10;
const int NMAX = 6e6 + 5;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int v[NMAX];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
int sum = 0, best = 0, start = 0, finish = 0, l, r;
for (int i = 1; i <= n; ++i)
{
sum += v[i];
if (sum >= 0)
++r;
else
{
sum = v[i];
l = r = i;
}
if (best < sum)
{
best = sum;
start = l;
finish = r;
}
}
fout << best << " " << start << " " << finish;
return 0;
}