Pagini recente » Cod sursa (job #840247) | Cod sursa (job #1995973) | Cod sursa (job #425175) | Cod sursa (job #1795711) | Cod sursa (job #1768438)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int inf = (1 << 30);
const int maxn = 6000005;
int maxime[maxn];
int pozmax[maxn];
int sp[maxn];
int main()
{
int n;
in >> n;
for(int i = 1; i <= n; i++)
{
int x;
in >> x;
sp[i] = sp[i - 1] + x;
}
maxime[n + 1] = -inf;
for(int i = n; i >= 1; i--)
{
/*
if(maxime[i + 1] < sp[i])
pozmax[i] = i;
else
pozmax[i] = pozmax[i + 1];
*/
maxime[i] = max(maxime[i + 1], sp[i]);
}
int mx = -inf;
int st = -1;
int dr = 0;
int pozst = 1;
int minim = 0;
for(int i = 1; i <= n; i++)
{
if(mx < sp[i] - minim)
{
st = pozst + 1;
dr = i;
}
mx = max(mx, sp[i] - minim);
if(minim > sp[i])
pozst = i;
minim = min(minim, sp[i]);
}
out << mx << " " << st << " " << dr;
return 0;
}