Pagini recente » Cod sursa (job #2125809) | Cod sursa (job #1880041) | Cod sursa (job #414416) | Cod sursa (job #2907158) | Cod sursa (job #448174)
Cod sursa(job #448174)
#include <fstream>
using namespace std;
#define N 6000000
int n;
int v[N + 1];
int d[N + 1];
int main()
{
ifstream fi("ssm.in");
ofstream fo("ssm.out");
fi >> n;
int i;
for(i = 1; i <= n; ++i) fi >> v[i];
int inc = 1, sf = 1, ssm = v[1];
int last_inc = 1;
d[1] = v[1];
for(i = 2; i <= n; ++i)
{
d[i] = v[i];
if(v[i] < v[i] + d[i - 1]) d[i] += d[i - 1];
if(d[i - 1] <= 0) last_inc = i;
if(ssm < d[i])
{
ssm = d[i];
sf = i;
inc = last_inc;
}
}
fo << ssm << " " << inc << " " << sf << "\n";
return 0;
}