Pagini recente » Cod sursa (job #2471045) | Cod sursa (job #3294351) | Cod sursa (job #964694) | Cod sursa (job #998080) | Cod sursa (job #3336708)
//https://www.infoarena.ro/problema/ssm
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("inline")
//#define _USE_MATH_DEFINES
//#define _CRT_SECURE_NO_WARNINGS
//#include <iostream>
#include <fstream>
//#include <vector>
//#include <cstring>
//#include <cmath>
//#include <bitset>
//#include <queue>
//#include <stack>
//#include <utility>
//#include <algorithm>
//#include <string>
//#include <map>
//#include <unordered_map>
//#include <set>
//#include <unordered_set>
//#include <cstdint>
//#include <climits>
//#include <iomanip>
//#include <cstdio>
//#include <tuple>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NRMAX = 6000000;
int s[NRMAX + 1];
int main()
{
//ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
int n, x, sum = 0, rez = INT_MIN, rezi, rezj, in = 1;
fin >> n;
for (int i = 1; i <= n; ++i)
{
int x;
fin >> x;
sum += x;
if (sum < 0)
{
sum = x;
in = i;
}
if (rez < sum)
{
rez = sum;
rezi = in;
rezj = i;
}
}
fout << rez << " " << rezi << " " << rezj << "\n";
return 0;
}