lemonoil的博客

题目连接题解简单DP。#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define maxn 1005 #define smin(x,y) (x)=min((x),(y)) using namespace std; int dp[maxn][maxn][2],sum[maxn],n,id,v,pos