poj 3280 Cheapest Palindrome
2014-06-22 11:05
357 查看
http://poj.org/problem?id=3280
View Code
#include <cstdio> #include <cstring> #include <algorithm> #define maxn 2000010 using namespace std; char str[maxn],ch; int a[maxn]; int n,m; int dp[2020][2020]; int main() { while(scanf("%d%d",&n,&m)!=EOF) { getchar(); scanf("%s",str); getchar(); int x,y; for(int i=0; i<n; i++) { scanf("%c %d%d",&ch,&x,&y); a[ch-'a']=min(x,y); getchar(); } for(int i=m-1; i>=0; i--) { for(int j=i+1; j<m; j++) { if(str[i]==str[j]) dp[i][j]=dp[i+1][j-1]; else dp[i][j]=min(dp[i+1][j]+a[str[i]-'a'],dp[i][j-1]+a[str[j]-'a']); } } printf("%d\n",dp[0][m-1]); } return 0; }
View Code
相关文章推荐
- POJ 3280 Cheapest Palindrome
- Poj 3280 Cheapest Palindrome【区间dp】
- 刷题——Cheapest Palindrome POJ - 3280
- POJ_3280_Cheapest_Palindrome_(动态规划)
- (中等) POJ 3280 Cheapest Palindrome,DP。
- poj-3280 Cheapest Palindrome[转]
- POJ 3280 Cheapest Palindrome【DP之经典回文问题】
- POJ3280 Cheapest Palindrome
- 【poj 3280】 Cheapest Palindrome 题意&题解&代码(C++)
- poj 3280 Cheapest Palindrome
- POJ 3280 Cheapest Palindrome
- Cheapest Palindrome.(POJ-3280)
- poj3280 Cheapest Palindrome
- poj-3280-Cheapest Palindrome
- POJ 3280--Cheapest Palindrome
- POJ 3280 Cheapest Palindrome
- POJ3280--Cheapest Palindrome
- poj 3280 Cheapest Palindrome
- POJ 3280 Cheapest Palindrome【DP】
- [区间dp] poj 3280 Cheapest Palindrome