Submission #1234150

---

Source Code Expand

#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef int64_t i64;

static i64 f(i64 *a, int n, int sgn, i64 sum, i64 ret) {
	if(n <= 0) return ret;
	if(sgn * (*a + sum) > 0) return f(a + 1, n - 1, -sgn, sum, ret);
	auto delta = sgn - (*a + sum);
	return f(a + 1, n - 1, -sgn, sum + delta, ret + abs(delta));
}

int main() {
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	auto a = new i64[n];
	for(int i = 0; i < n; i++) {
		cin >> a[i];
		if(i != 0) a[i] += a[i - 1];
	}
	cout << min(f(a, n, +1, 0, 0), f(a, n, -1, 0, 0)) << endl;
	return 0;
}

Submission Info

Judge Result