dp
文章平均质量分 55
triplebee
人狠话不多
展开
-
Hdu 1025
dp二分题目,WA点多多,下面一一阐述。#include#include#includeusing namespace std;int dp[500005];int map[500005];int main(){ int n,i,j,k,cases=0; int len,up,low,mid; while(~scanf("%d",&n)) {原创 2014-03-24 21:38:26 · 693 阅读 · 0 评论 -
Leetcode 121 Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2016-10-19 16:49:38 · 982 阅读 · 0 评论 -
Leetcode 120 Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [原创 2016-10-19 16:41:28 · 948 阅读 · 0 评论 -
Leetcode 115 Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be non原创 2016-10-14 17:18:59 · 1219 阅读 · 0 评论 -
Leetcode 87 Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \ gr原创 2016-09-27 22:48:58 · 1216 阅读 · 0 评论 -
Leetcode 72 Edit Distance DP好题
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:原创 2016-09-21 18:58:29 · 1595 阅读 · 0 评论 -
Leetcode 70 Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?每次爬一到两步,到终点有多少种办法?简单DP,往后1步2原创 2016-09-20 20:34:43 · 1630 阅读 · 0 评论 -
Leetcode 63 Unique Paths II
Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the原创 2016-09-19 19:37:41 · 1196 阅读 · 0 评论 -
Leetcode 62 Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the原创 2016-09-19 13:41:18 · 1406 阅读 · 0 评论 -
Leetcode 53 Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1] ha原创 2016-09-18 18:47:06 · 1021 阅读 · 0 评论 -
Leetcode 32 Longest Valid Parentheses DP好题
就喜欢做这种想法题,一开始的想法和之前做过的一道括号匹配差不多,用栈。记录未匹配的括号位置,然后两两相减找到最大值,过了,但速度并不快。在discuss中看到有人用DP,恍然大悟!dp[i]表示以当前位置为终点的最长长度,则只能在)处更新,如果s[i-1-dp[i-1]]=='(',则说明当前位置可以和i-1-dp[i-1]位置匹配,dp[i]=dp[i-1]+2;然后还要加上匹配位置之前的最长长度dp[i]+=dp[i-dp[i]];原创 2016-09-05 13:43:45 · 3954 阅读 · 0 评论 -
Codeforces 461B
比赛时就知道是树形dp但是和一般的熟悉的树形背包原创 2014-08-29 15:56:23 · 1173 阅读 · 0 评论 -
Codeforces 417D
状压DP学到一手,位操作时注意超出原创 2014-08-04 20:16:02 · 1058 阅读 · 0 评论 -
HDU4832
由于水平和竖直相互独立,所以可以分开计数,最后再用组合数算一下,万年lao原创 2014-08-04 18:33:40 · 902 阅读 · 0 评论 -
POJ2836
状压DP死活想不到啊,开始还以为是数据结构题,真是膜拜宋威大大。包括点的矩形最小一定以这些点为顶点,所以枚举所有点对,构成所有状态。由于不存在面积为0的矩形,所以当横纵坐标相同时得特判。然后就是状压dp了。#include#include#include#include#include#include#include#includeusing namespace s原创 2014-07-28 21:20:17 · 1222 阅读 · 0 评论 -
HDU4405
以前不是太会求期望的题目,就是做出来的要是靠一知半解的YY出来,昨天原创 2014-07-23 12:02:04 · 825 阅读 · 0 评论 -
POJ1837
好巧妙的背包杠杆原理:l原创 2014-07-01 22:55:23 · 960 阅读 · 0 评论 -
Leetcode 123 Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You may原创 2016-10-20 19:12:20 · 972 阅读 · 0 评论