【題解】[牛客OI周賽3-提高組]B.1408 線性DP

題目鏈接 #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int N=2e3+10; int n,dp[N][N],w[N],b[N],c1[N][N],c2[N][N]; int main() { //freopen("in.txt","r"

>>阅读原文<<