UVa 11584 - Partitioning by Palindromes(DP)
来源:互联网 发布:mac软件下载网站推荐 编辑:程序博客网 时间:2024/05/22 02:45
给出一个字符串,判断他最少划分成几个回文串。
枚举字符串终点,转移方程为
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=1010;char s[maxn];int d[maxn];inline bool ok(int l,int r){ while(l<=r){ if(s[l]!=s[r]) return false; ++l,--r; } return true;}int main(){ int t; scanf("%d",&t); while(t--){ scanf("%s",s); int n=(int)strlen(s); for(int i=0;i<n;++i){ d[i]=i+1; for(int j=0;j<=i;++j) if(ok(j,i)) d[i]=min(d[i],d[j-1]+1); } printf("%d\n",d[n-1]); } return 0;}
0 0
- uva 11584 - Partitioning by Palindromes (dp)
- 【uva-11584】Partitioning by Palindromes(dp)
- UVA 11584-Partitioning by Palindromes(DP)
- UVa 11584 - Partitioning by Palindromes(DP)
- UVa 11584:Partitioning by Palindromes(DP)
- uva 11584 - Partitioning by Palindromes(简单dp)
- UVA 11584 - Partitioning by Palindromes(基础dp)
- uva 11584 - Partitioning by Palindromes(DP)
- UVA 11584 - Partitioning by Palindromes DP
- uva 11584 - Partitioning by Palindromes(dp)
- uva 11584 Partitioning by Palindromes | dp
- uva 11584 Partitioning by Palindromes dp
- Partitioning by Palindromes - UVa 11584 dp
- Uva 11584 - Partitioning by Palindromes dp
- UVA 11584 Partitioning by Palindromes DP
- UVA - 11584 Partitioning by Palindromes DP
- uva 11584 Partitioning by Palindromes 线性dp
- UVA 题目11584 - Partitioning by Palindromes(DP)
- JDBC
- 如何查看操作系统端口占用情况及知识点引申
- NOIP 2004 普及组 sdnu 1168.FBI树
- ngx_hash散列表
- 重设“目录服务还原模式”的系统管理员密码
- UVa 11584 - Partitioning by Palindromes(DP)
- java中,各种日期的转换及计算
- 缓动函数 速查
- 阿里电话面试题详解
- POJ 题目1157 LITTLE SHOP OF FLOWERS(DP)
- 一些经典的计算机书籍
- [CodeVS1080] 线段树练习(单点修改+求和)
- 颁奖晚会(HDU 2048)---15.7.25
- 背单词App开发日记4