Pagini recente » Cod sursa (job #2125076) | Cod sursa (job #1718988) | Cod sursa (job #1289270) | Cod sursa (job #2370792) | Cod sursa (job #900235)
Cod sursa(job #900235)
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int maxn = 6000001;
int S[maxn], N;
int main()
{
in >> N;
int sum = 0, idx = 1, beg, end, bestSum = -int(2e9);
for (int i = 1; i <= N; i++) in >> S[i];
for (int i = 1; i <= N; i++)
{
if (sum < 0)
{
sum = S[i]; idx = i;
}
else sum += S[i];
if (bestSum < sum)
{
bestSum = sum; beg = idx; end = i;
}
}
out << bestSum << ' ' << beg << ' ' << end;
return 0;
}