07 2021 档案

kuangbin专题二十二：区间DP
摘要：POJ2955 Brackets #include<iostream> #include<cstdio> #include<cstring> using namespace std; const int maxn = 105; char s[maxn]; int dp[maxn][maxn]; in 阅读全文
posted @ 2021-07-24 21:42 Nanachi 阅读(35) 评论(0) 推荐(0)