Pagini recente » Cod sursa (job #2399630) | Cod sursa (job #1534351) | Cod sursa (job #2595553) | Cod sursa (job #2074878) | Cod sursa (job #3000571)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int MAXN = 7000005;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++ i)
#define Max(a, b) ((a) > (b) ? (a) : (b))
int main(void) {
ifstream fin("ssm.in");
int n, S;
int bestSum = -int(2e9), sum = 0, st, stBest, drBest;
fin >> n;
for (int i = 1; i <= n; ++ i) {
fin >> S;
if (sum < 0)
{
sum = S;
st = i;
}
else
sum += S;
if (bestSum < sum)
{
bestSum = sum;
stBest = st;
drBest = i;
}
}
ofstream fout("ssm.out");
fout << bestSum << " " << stBest << " " << drBest;
fin.close();
fout.close();
return 0;
}