Pagini recente » Cod sursa (job #2329447) | Cod sursa (job #1096308) | Cod sursa (job #390651) | Cod sursa (job #2090113) | Cod sursa (job #1847444)
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
//#include <windows.h>
#include <deque>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int x[6000005];
FILE *f, *g;
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
cin >> x[i];
int id, sum = 0, ma = -long(2e9), ii, ev;
for(int i = 0; i < n; i++)
{
if(sum < 0)
{
sum = x[i];
ii = i;
}
else
sum += x[i];
if(ma < sum)
{
ma = sum;
id = ii;
ev = i;
}
}
cout << ma << " " << id + 1 << " " << ev + 1;
return 0;
}