NBUT 1222 English Game(trie树+DP)
2015-08-19 09:46
477 查看
[1222] English Game
时间限制: 1000 ms 内存限制: 131072 K问题描述
This English game is a simple English words connection game.
The rules are as follows: there are N English words in a dictionary, and every word has its own weight v. There is a weight if the corresponding
word is used. Now there is a target string X. You have to pick some words in the dictionary, and then connect them to form X. At the same time, the sum weight of the words you picked must be the biggest.
输入
There are several test cases. For each test, N (1<=n<=1000) and X (the length of x is not bigger than 10000) are given at first. Then N rows follow. Each row contains a word wi (the length is not bigger than 30) and the weight of it. Every word is composed
of lowercases. No two words in the dictionary are the same.
输出
For each test case, output the biggest sum weight, if you could not form the string X, output -1.
样例输入
1 aaaa a 2 3 aaa a 2 aa 5 aaa 6 4 abc a 1 bc 2 ab 4 c 1 3 abcd ab 10 bc 20 cd 30 3 abcd cd 100 abc 1000 bcd 10000
样例输出
8 7 5 40 -1
题目大意:
给出一个目标字符串和n个字符串及其对应的权值,求用这些字符串中的1个或多个组成目标字符串的最大权值。
解题思路:
用trie树保存b个字符串及其权值,接下来就是动态规划了。
到达某一点i,遍历trie树找到i+1为第一个字符的字符串,在结束位置j,dp[j]=max(dp[j],dp[i]+val[i+1到j之间的字符串])。除第0位之外,如果dp[i]=0说明没有字符串能够组成0到i之间的字符串,那么就不用查询。
参考代码:
#include<map> #include<stack> #include<queue> #include<cmath> #include<vector> #include<cctype> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const double eps=1e-10; const int INF=0x3f3f3f3f; const int MAXN=1e4+50; typedef long long LL; struct node { node* next[26]; int val; node() { val=0; memset(next,0,sizeof(next)); } }*root; int n,L,dp[MAXN]; char s[MAXN]; void trie_insert(node* start,char* word,int v) { node* now=start; int l=strlen(word); for(int i=0; i<l; i++) { int id=word[i]-'a'; if(now->next[id]==NULL) now->next[id]=new node(); now=now->next[id]; } now->val=v; } int trie_query(node* start,int pos) { node* now=start; int i; for(i=pos+1; i<=L; i++) { int id=s[i]-'a'; if(now->next[id]==NULL) break; now=now->next[id]; if(now->val) dp[i]=max(dp[i],dp[pos]+now->val); } } int main() { #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif // ONLINE_JUDGE while(scanf("%d%s",&n,s+1)!=EOF) { root=new node(); L=strlen(s+1); memset(dp,0,sizeof(dp)); for(int i=0; i<n; i++) { char tmp[MAXN]; int d; scanf("%s%d",tmp,&d); trie_insert(root,tmp,d); } for(int i=0; i<=L; i++) if(dp[i]||i==0)//如果dp[i]=0说明没有字符串能够组成0到i之间的字符串,那么就不用查询 trie_query(root,i); printf("%d\n",dp[L]==0?-1:dp[L]); } return 0; }
相关文章推荐
- POJ 1113 Wall(凸包周长)
- 算法竞赛入门经典:第九章 动态规划初步 9.2完全01背包
- 用正则表达式过滤出html中得 img标签,并且把URL链接给取出来
- TortoiseSVN文件夹及文件图标不显示解决方法
- Maven教程
- ztree入门应用(二)
- 【appium】根据class_name定位元素
- Human Gene Functions
- 提升c++builder 代码输入流畅度的配置
- jqgrid的常用操作
- rickyyu学FPGA——notepad++实用快捷键的使用
- Windows 10 Build 10525安装后感觉如何?win10 10525上手视频
- 关于学习c++和编程的50个观点
- BZOJ1044
- Linux定时器工具-crontab 各参数详解及如何查看日志记录
- c语言字符数组与字符串深入解析
- 记录自己成长和学习
- Please, commit your changes or stash them before you can merge.
- php类的自动加载
- 文本框只能输入数字