Pagini recente » Cod sursa (job #34249) | Cod sursa (job #3037634) | Cod sursa (job #2890499) | Cod sursa (job #496063) | Cod sursa (job #268279)
Cod sursa(job #268279)
#include <fstream>
using namespace std;
int main(void)
{
ifstream in("ssm.in");
ofstream out("ssm.out");
int count, number;
int partial_sum = 0, lowest_sum = 0, idx = 0;
int best_result = -int(1e9), begining = 0, ending = 0;
in >> count;
for (int i = 1; i <= count; ++ i)
{
in >> number;
partial_sum += number;
if (best_result < partial_sum - lowest_sum)
best_result = partial_sum - lowest_sum,
begining = idx + 1, ending = i;
if (lowest_sum > partial_sum)
lowest_sum = partial_sum, idx = i;
}
out << best_result << " " << begining << " " << ending;
in.close(), out.close();
return 0;
}