UVa11584 Partitioning by Palindromes
来源:互联网 发布:幼儿园打卡软件 编辑:程序博客网 时间:2024/05/29 15:44
题目描述
求最少能划成多少个回文串,比较简单。
设
如果临时判断回文串要
总时间复杂度
用
总时间复杂度降为
代码
#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;char s[1010];bool is[1010][1010];int f[1010];int main(){ int t; cin>>t; while(t--){ scanf("%s",s+1); int l=strlen(s+1); memset(is,0,sizeof(is)); for(int i=1;i<=l;i++){ for(int k=0;i-k>0&&i+k<=l;k++) if(s[i-k]==s[i+k]) is[i-k][i+k]=1; else break; if(s[i]==s[i+1]){ for(int k=0;i-k>0&&i+k+1<=l;k++) if(s[i-k]==s[i+k+1]) is[i-k][i+k+1]=1; else break; } } f[0]=0; for(int i=1;i<=l;i++){ f[i]=i; for(int j=0;j<i;j++){ if(is[j+1][i]) f[i]=min(f[i],f[j]+1); } } printf("%d\n",f[l]); } return 0;}
阅读全文
0 0
- UVa11584-Partitioning by Palindromes
- uva11584 Partitioning by Palindromes
- UVa11584 Partitioning by Palindromes
- uva11584 Partitioning by Palindromes
- UVa11584 Partitioning by Palindromes
- UVA11584---Partitioning by Palindromes(dp)
- UVA11584 - Partitioning by Palindromes - 动态规划
- UVa11584 - Partitioning by Palindromes(动态规划)
- 【动态规划】[UVa11584]Partitioning by Palindromes
- UVA11584-Partitioning by Palindromes(dp)
- UVA11584[Partitioning by Palindromes] 动态规划
- Partitioning by Palindromes
- Partitioning by Palindromes
- Partitioning by Palindromes
- Partitioning by Palindromes uva111584
- Partitioning by Palindromes
- Partitioning by Palindromes UVA
- Partitioning by Palindromes UVA
- hdu 1695 GCD
- 史上最简洁C# 生成条形码图片思路及示例分享
- Scala红皮书练习10.9探讨
- 前端小总结之简单的图文混排
- 09:图像旋转翻转变换
- UVa11584 Partitioning by Palindromes
- Spring mvc和SSH如何取舍?
- UVa10003 Cutting Sticks
- HDU1728逃离迷宫
- 7-31 记录自己编写的 关于限定用户输入的方法
- springmvc
- iOS SDAutoLayout(自动布局)~详解
- git常用命令
- 我为什么不打工, 我为什么不买房子