ABC251 (E)Takahashi and Animals(dp)

E - Takahashi and Animalshttps://atcoder.jp/contests/abc251/tasks/abc251_e

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false);
#define lowbit(x) ((x)&(-x))

const int N = 3e5 + 19;
int a[N];
ll f[N][2];
int main() {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", a + i);
	ll ans;
	f[1][0] = 1e18, f[1][1] = a[1];
	for (int i = 2; i <= n; i++) {
		f[i][0] = f[i - 1][1];
		f[i][1] = min(f[i - 1][1], f[i - 1][0]) + a[i];
	}
	ans = min(f[n][1], f[n][0]);
	f[1][1] = 1e18, f[1][0] = 0;
	for (int i = 2; i <= n; i++) {
		f[i][0] = f[i - 1][1];
		f[i][1] = min(f[i - 1][1], f[i - 1][0]) + a[i];
	}
	printf("%lld", min(ans, f[n][1]));
	return 0;
}