Pagini recente » Cod sursa (job #580953) | Cod sursa (job #2769053) | Cod sursa (job #2424962) | Clasament jbfejoeg | Cod sursa (job #2394810)
#include <fstream>
#include <queue>
#include <cstring>
#define NMAX 6000011
#define intt long long
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
intt n, p, u, solmax,ps,us;
int v[NMAX], pede[NMAX];
int main()
{
f >> n;
for(int i = 1; i <= n; ++i) f >> v[i];
pede[1] = v[1];
solmax = v[1]; p = 1; u = 1;
ps = us = 1;
for(int i = 2; i <= n; ++i)
{
if(pede[i-1] + v[i] > v[i])
{
u++;
pede[i] = pede[i-1] + v[i];
}
else
{
pede[i] = v[i];
u = p = i;
}
if(pede[i] > solmax)
ps = p, us = u, solmax = pede[i];
}
g << solmax << ' ' << ps << ' ' <<us;
g.close(); f.close();
return 0;
}