例题9-23 有趣的游戏(Fun Game, ACM/ICPC Beijing 2004, UVa1204)
原题链接:https://vjudge.net/problem/UVA-1204分类:动态规划备注:字符串#includeusingnamespacestd;constintN=20;constintINF=0x3f3f3f3f;intn,len[N],cover[N][N][2][2],dp[1>n&&n){for(inti=0;i>input[i].s;input[i].rev=input[i