紫书动规 例题9-7 UVA - 11584 Partitioning by Palindromes dp
题目链接:https://vjudge.net/problem/UVA-11584题意:题解:dp[i]:=考虑到第i个字符,的最少划分dp[i]=min{dp[j]+1}(0usingnamespacestd;typedeflonglongll;#defineMS(a)memset(a,0,sizeof(a))#defineMPmake_pair#definePBpush_backconstin