Pagini recente » Cod sursa (job #937110) | Cod sursa (job #46263) | Cod sursa (job #647320) | Cod sursa (job #2056809) | Cod sursa (job #1043432)
#include <fstream>
using namespace std;
int main()
{
ifstream IN("ssm.in");
ofstream OUT("ssm.out");
int n; IN >> n;
int bestSum;
int beg = 1, end = 1;
int *best = new int[n];
int *vec = new int[n];
for (int i = 0; i < n; i++)
{
IN >> vec[i];
}
bestSum = vec[0];
for (int i = 0; i < n; i++)
{
best[i] = vec[i];
if (best[i] < best[i - 1] + vec[i])
best[i] = best[i - 1] + vec[i];
else
beg = i + 1;
if (bestSum < best[i])
{
bestSum = best[i];
end = i + 1;
}
}
OUT << bestSum << " " << beg << " " << end << "\n";
delete[] best;
delete[] vec;
return 0;
}