| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
ac代码!#include<iostream>
#define js ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
int w[30],n,m,dp[2005][2005];
char s[2005],ch;
int main() {
int x,y;
js;
while(cin>>n>>m) {
cin>>s;
for(int i=0;i<n;++i) {
cin>>ch>>x>>y;
w[ch-'a']=min(x,y);
}
for(int i=m-1;i>=0;--i)
for(int j=i+1;j<m;++j)
if(s[i]==s[j]) dp[i][j]=dp[i+1][j-1];
else dp[i][j]=min(dp[i+1][j]+w[s[i]-'a'],dp[i][j-1]+w[s[j]-'a']);
cout<<dp[0][m-1]<<endl;
}
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator