Pagini recente » Cod sursa (job #3281121) | Cod sursa (job #2600541) | Cod sursa (job #1185354) | Cod sursa (job #1805878) | Cod sursa (job #2737058)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int maxn = 6000005;
int sp[maxn];
int v[maxn];
int main()
{
int n;
in >> n;
for(int i = 1; i <= n; i++)
{
in >> v[i];
sp[i] = sp[i - 1] + v[i];
}
int mx = -(1 << 29);
int pozmn = 0;
int minim = 0;
int st = 0, dr = 0;
for(int i = 1; i <= n; i++)
{
if(mx < sp[i] - minim)
{
mx = sp[i] - minim;
st = pozmn + 1;
dr = i;
}
if(minim > sp[i])
{
minim = sp[i];
pozmn = i;
}
}
out << mx << " " << st << " " << dr << "\n";
return 0;
}