CodeForces 607B:Zuma(区间DP)
来源:互联网 发布:单代号搭接网络计划sts 编辑:程序博客网 时间:2024/05/20 07:20
Zuma
Problem Description
Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.In one second, Genos is able to choose exactly one continuous substring of colored gemstones that is a palindrome and remove it from the line. After the substring is removed, the remaining gemstones shift to form a solid line again. What is the minimum number of seconds needed to destroy the entire line?Let us remind, that the string (or substring) is called palindrome, if it reads same backwards or forward. In our case this means the color of the first gemstone is equal to the color of the last one, the color of the second gemstone is equal to the color of the next to last and so on.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 500) — the number of gemstones.The second line contains n space-separated integers, the i-th of which is ci (1 ≤ ci ≤ n) — the color of the i-th gemstone in a line.
Output
Print a single integer — the minimum number of seconds needed to destroy the entire line.
Example
Note
In the first sample, Genos can destroy the entire line in one second.In the second sample, Genos can only destroy one gemstone at a time, so destroying three gemstones takes three seconds.In the third sample, to achieve the optimal time of two seconds, destroy palindrome 4 4 first and then destroy palindrome 1 2 3 2 1.
题意:
给出n个数字,我们来逐步删除,如果一个子串是回文数,就可以直接删除,问删除完最少的次数。
解题思路:
设dp[i][j]为删除区间[i,j]所需最小次数。。算了讲不清楚的
Code:
#include <iostream>#include <cstdio>using namespace std;const int maxn=505;int a[maxn];int dp[maxn][maxn];int dfs(int i,int j){ if(i>=j) return 1; if(dp[i][j]) return dp[i][j]; int ans=1e9; if(a[i]==a[j]) ans=min(ans,dfs(i+1,j-1)); for(int k=i;k<j;k++) ans=min(ans,dfs(i,k)+dfs(k+1,j)); return dp[i][j]=ans;}int main(){ int n; scanf("%d",&n); for(int i=0; i<n; i++) { scanf("%d",a+i); } printf("%d\n",dfs(0,n-1)); return 0;}
阅读全文
0 0
- CodeForces 607 B. Zuma(区间DP)
- CodeForces 607B:Zuma(区间DP)
- Codeforces 607B - Zuma (区间DP)
- Codeforces 607B Zuma 【区间dp】
- codeforces 607B Zuma 区间dp
- codeforces 607 B Zuma(区间dp)
- Codeforces 607B Zuma (区间dp)
- [Codeforces 607B Zuma]区间DP
- [区间DP] Zuma CodeForces 607B
- codeforces 607B #336B Zuma [区间DP]【动态规划】
- Codeforces Round #336 (Div. 1)B. Zuma (区间DP)
- Codeforces 607B:Zuma DP
- Codeforces Round #336 (Div. 1)-B. Zuma(区间dp)
- codeforces 607B. Zuma
- CodeForces-607B Zuma
- Codeforces Round #336 (Div. 2) D. Zuma(区间dp)
- Codeforces Round #336 (Div. 2)-D Zuma(区间DP)
- codeforces #336 D. Zuma (区间dp)
- sc2017新高二&高一模拟赛2 总结
- Java7和Java8的HashMap底层思想解析
- [BZOJ3435/UOJ55/WC2014]紫荆花之恋
- 已知 中序 和 前序 后序 任一 求另外一种 C实现~
- Java学习日记3-MySql中的模糊查询
- CodeForces 607B:Zuma(区间DP)
- 网络安全技术之TCP三次握手及原生缺陷
- 前端知识总结
- 网络编程相关函数深层次解析
- 线程池
- nodejs的forever守护进程
- QDR SRAM接口FPGA 详细Verilog代码
- [译]图像分类:数据驱动方法、K-最近邻、train/val/test分离 (1)
- 金融企业软件测试中心筹备书-软件度量篇