P5154 数列游戏 [区间DP]

传送门

先来一波区间DP的套路

记dp[i] 为1-i 的答案

---

#include
#define N 805
#define LL long long
#define inf 1000000000000000
using namespace std;
LL f[N][N], dp[N];
int A[N], B[N], n;
int read(){
	int cnt = 0; char ch = 0;
	while(!isdigit(ch)) ch = getchar();
	while(isdigit(ch)) cnt = cnt * 10 + (ch-'0'), ch = getchar();
	return cnt; 
}
int gcd(int a,int b){ return !b ? a : gcd(b, a%b);}
int main(){
	n = read();
	for(int i=1;i<=n;i++) A[i] = read();
	for(int i=1;i<=n;i++) B[i] = read();
	for(int i=1;i