提出 #63596962

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

const int mod = 998244353;
const LL LINF = 1e18;

int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}

int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}

int mult(int a, int b)
{
	return (LL)a * b % mod;
}

int binpow(int a, LL n)
{
	int res = 1;
	while (n)
	{
		if (n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	int n;
	cin >> n;
	VI a(n);
	for (int& ai : a)
		cin >> ai;
	vector<LL> dp(n + 1, -LINF);
	dp[0] = 0;
	FOR(i, 1, n + 1)
	{
		dp[i] = dp[i - 1] + a[i - 1];
		if (i > 1)
		{
			dp[i] = max(dp[i], dp[i - 2]);
		}
	}
	cout << dp[n] << "\n";
	return 0;
}

提出情報

ジャッジ結果