Pagini recente » Cod sursa (job #1575653) | Cod sursa (job #1051929) | Cod sursa (job #1798838) | Cod sursa (job #1766086) | Cod sursa (job #1131925)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
int main()
{
int *v, *s, max = INT_MIN, min, poz[2] = { 0, 0 }, n;
ifstream in("ssm.in");
ofstream out("ssm.out");
in >> n;
v = new int[n];
s = new int[n];
s[0] = 0;
in >> v[0];
min = v[0];
for (int i = 1; i < n; i++)
{
in >> v[i];
s[i] = s[i - 1] + v[i];
if (s[i] < min)
{
min = s[i];
poz[0] = i+1;
}
else
{
if (s[i] - min > max)
{
poz[1] = i;
max = s[i] - min;
}
}
}
out << max << poz[0] + 1 << poz[1] + 1;
delete[] v, s;
return 0;
}