Pagini recente » Cod sursa (job #707475) | Cod sursa (job #1096905) | Cod sursa (job #2965317) | Cod sursa (job #3179961) | Cod sursa (job #2151501)
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int N = 6000002;
int n, d[2], capat[N];
int main()
{
in >> n;
int x, j = 1, m = 0, poz = 0;
for (int i = 1, k = 1; i <= n; i++, k++) {
in >> x;
if (d[(i - 1) % 2] < 0) j = i;
capat[i] = j;
d[i % 2] = max(d[(i - 1) % 2] + x, x);
if (d[i % 2] > m) {
poz = k;
m = d[i % 2];
}
}
in.close();
out << m << ' ' << capat[poz] << ' ' << poz;
out.close();
}