Pagini recente » Cod sursa (job #836674) | Cod sursa (job #1706205) | Cod sursa (job #938825) | Istoria paginii runda/infos0ft_2019 | Cod sursa (job #1660054)
#include <iostream>
#include <fstream>
using namespace std;
int
v[6000001];
int main()
{
int
n,
p = 1,
s = 0,
r = 0,
pmax
;
long long sm = (long long) - 2000000000;
long long valmin = (long long) - 2000000000;
ifstream f("ssm.in");
ofstream o("ssm.out");
f>>n;
for(int i = 1 ; i <= n; i++)
{
f>>v[i];
s += v[i];
if(s < 0)
{
p = i + 1;
s = 0;
}
else if(s > sm)
{
sm = s;
r = i;
pmax = p;
}
}
if(sm < 0)
{
for(int i = 1; i <= n; i++)
if(v[i] < valmin)
valmin = v[i];
sm = valmin;
}
o<< sm<<" "<< pmax<< " "<< r;
}