Submission #4038136

---

Source Code Expand

#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 1999999999999999999
#define ALL(n) n.begin(),n.end()
#define ABS(a,b) max(a,b) - min(a,b)

ll n, in[114514], s[2] = { 1,-1 }, a[2] = {},x[2][114514];
int main() {
	cin >> n;
	REP(i, n) cin >> in[i];
	REP(k, 2) {
		REP(i, n) {
			if (s[k] > 0) {
				if (x[k][i] + in[i] < 1) {
					a[k] += 1 - (x[k][i] + in[i]);
					x[k][i + 1] = 1;
				}
				else x[k][i + 1] = x[k][i] + in[i];
			}
			else {
				if (x[k][i] + in[i] >= 0) {
					a[k] += 1 + (x[k][i] + in[i]);
					x[k][i + 1] = -1;
				}
				else x[k][i + 1] = x[k][i] + in[i];
			}
			s[k] *= -1;
		}
	}
	cout << min(a[0], a[1]) << endl;
}
	

Submission Info

Judge Result