Pagini recente » Cod sursa (job #103466) | Cod sursa (job #2990164) | Cod sursa (job #832885) | Cod sursa (job #704764) | Cod sursa (job #1231656)
#include <fstream>
#define SIZE 6000000
using namespace std;
int V[SIZE];
int main()
{
ifstream ifs("ssm.in");
ofstream ofs("ssm.out");
int n; ifs >> n;
for (int i = 0; i < n; ++i)
ifs >> V[i];
int best_sum = V[0], best_left = 0, best_right = 0;
int sum = V[0], left = 0;
for (int i = 1; i < n; ++i)
{
sum += V[i];
if (sum < 0)
{
sum = V[i];
left = i;
}
if (sum > best_sum)
{
best_sum = sum;
best_left = (best_left == left ? best_left : left);
best_right = i;
}
}
ofs << best_sum << " " << best_left + 1 << " " << best_right + 1 << "\n";
return 0;
}