传送门:Brackets 题意:()与[ ]括号匹配,求有效匹配个数。 解法:简单区间DP
标签:动态规划
【多重背包】Buns
传送门:Codeforces Lavrenty, a baker, is going to make several buns with stuffings and sell them.
传送门:Brackets 题意:()与[ ]括号匹配,求有效匹配个数。 解法:简单区间DP
传送门:Codeforces Lavrenty, a baker, is going to make several buns with stuffings and sell them.