动态规划
文章平均质量分 70
Scarlett·S
学海无涯,回头无岸
展开
-
PAT C 语言入门题目-7-64 最长对称子串 (25 分)四种方法求解(暴力枚举+动态规划+中心扩展+manacher算法(马拉车))
7-64 最长对称子串 (25 分) 对给定的字符串,本题要求你输出最长对称子串的长度。例如,给定Is PAT&TAP symmetric?,最长对称子串为s PAT&TAP s,于是你应该输出11。 输入格式: 输入在一行中给出长度不超过1000的非空字符串。 输出格式: 在一行中输出最长对称子串的长度。 输入样例: Is PAT&TAP symmetri...转载 2019-01-28 21:19:02 · 1121 阅读 · 0 评论 -
VJ2-Permute Digits(dp)
C. Permute Digits time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given two positive integer numbers a and b. Permute (cha...原创 2018-02-21 15:14:25 · 143 阅读 · 0 评论 -
VJ 4 F - ABC087C AtCoder - 3881(dp)
Problem Statement We have a 2×N grid. We will denote the square at the i-th row and j-th column (1≤i≤2, 1≤j≤N) as (i,j). You are initially in the top-left square, (1,1). You will travel to the bo...原创 2018-03-20 11:17:23 · 235 阅读 · 0 评论 -
C++ Pat甲级1007 Maximum Subsequence Sum (25 分)(dp)
1007 Maximum Subsequence Sum (25 分) Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Su...原创 2019-02-23 20:12:02 · 229 阅读 · 0 评论 -
C++ Pat甲级1008 Elevator (20 分)
1008 Elevator (20 分) The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified...原创 2019-02-23 20:46:28 · 161 阅读 · 0 评论