DP:Palindrome
来源:互联网 发布:怎么在淘宝上买发票 编辑:程序博客网 时间:2024/06/05 21:01
Palindrome
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 42770 Accepted: 14582
Description
A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of characters to be inserted into the string in order to obtain a palindrome.
As an example, by inserting 2 characters, the string "Ab3bd" can be transformed into a palindrome ("dAb3bAd" or "Adb3bdA"). However, inserting fewer than 2 characters does not produce a palindrome.
As an example, by inserting 2 characters, the string "Ab3bd" can be transformed into a palindrome ("dAb3bAd" or "Adb3bdA"). However, inserting fewer than 2 characters does not produce a palindrome.
Input
Your program is to read from standard input. The first line contains one integer: the length of the input string N, 3 <= N <= 5000. The second line contains one string with length N. The string is formed from uppercase letters from 'A' to 'Z', lowercase letters from 'a' to 'z' and digits from '0' to '9'. Uppercase and lowercase letters are to be considered distinct.
Output
Your program is to write to standard output. The first line contains one integer, which is the desired minimal number.
Sample Input
5Ab3bd
Sample Output
2
#include <iostream>#include <cstdio>#include <cstring>using namespace std;char str[5010];short m[5010][5010]; //m[i][j]代表从i 到j最小需要插入的数量int main(){ int n; int i, j, k; while(cin >> n){ scanf("%s", str); for(i = 0; i < n; i ++){ m[i][i] = 0; } for(k = 1; k < n; k ++) //表示从跨度为2到n的遍历 for(i = 0; i < n - k; i ++){ //从m[0][k]一直到m[n-k-1][n-1]的遍历 if(str[i] == str[i + k]) m[i][i + k] = m[i + 1][i - 1 + k]; else m[i][i + k] = 1 + (m[i][i - 1 + k] < m[i + 1][i + k]?m[i][i - 1 + k]:m[i + 1][i + k]); } cout << m[0][n - 1] << endl; } return 0;}
- DP:Palindrome
- Palindrome (DP)
- pku 1159 Palindrome(DP)
- dp poj 1159 Palindrome
- DP::poj1159 Palindrome
- POJ 1159 Palindrome DP
- poj1159 Palindrome (dp)
- poj 1159 Palindrome 【DP】
- HDU 1513 Palindrome dp
- POJ 1159 Palindrome dp
- HDU - Palindrome(dp)
- POJ 1159 Palindrome(DP)
- 10453 Make Palindrome (dp)
- uva10617 - Again Palindrome(dp)
- Cheapest Palindrome 简单dp
- POJ 1159 Palindrome(DP)
- 【DP】Palindrome Partitioning I
- 【DP】Palindrome Partitioning II
- ARM—简单操作GPIO入门
- CentOS PPTP VPN服务器快速安装教程
- [电源、屏保、闹钟、日程、墙纸] UILocalNotification实现本地的闹钟提醒的方法。
- 自己动手写操作系统 之 连接器
- http://bbs.cstong.net/read-htm-tid-553476-fpage-2.html
- DP:Palindrome
- org.hibernate.NonUniqueObjectException: a different object with the same ide
- Linux禁用端口
- 国外接活网站报告 - 4大国外自由职业者接活网站
- asp.net prepared for Interview (4)
- 数组非连续元素最大和
- QT SDK 连接 MySql (windows 7 )
- 软文营销的概念
- 金蝶时期的那些笔记