Miss.Zhou

分类

###基本算法(～ o ～)Y(1) .net(1) 2014多校联合(2) acm(12) arcgis(1) bfs(1) c#(1) c++(1) CF(2) codeforces(5) css(1) dp(27) git使用(1) hdu(27) java(1) javascript(4) LeetCode(47) leetcode (1) lightoj(1) oi(1) php(12) poj(13) poj 搜索算法 acm(1) poj 算法线段树懒惰标记(1) python(2) RMQ(1) socket(1) splay(1) tarjan(3) trie(3) vmware(1) web开发(1) xml(1) —dp(9) —STL(2) ———哈希表(2) ———网络流(1) —二分(2) —图论(7) —字符串(4) —思维题(1) —搜索(7) —数据结构(5) —数论(9) —贪心(4) 三分(1) 二分图(3) 前端(1) 动态规划(1) 匈牙利算法(1) 博弈(1) 压缩(1) 双连通分量(1) 图论(4) 多校(2) 并查集(1) 并查集 poj(1) 并查集几何 hdu(1) 并查集算法(2) 广搜(2) 思维题(1) 拓扑排序(1) 搜素(1) 搜索(1) 操作系统(2) 数据结构(1) 数论算法(3) 最佳二分匹配(1) 最大二分匹配(2) 最小树形图(1) 未归档(397) 杭电(7) 树型dp(2) 模拟(1) 欧拉回路(1) 正则表达式(1) 深搜(1) 深搜 hdu 算法(1) 矩阵(1) 算法(10) 算法并查集(1) 线段树(6) 编程(1) 网络流(4) 计算机基础(4) 设计模式(19) 贪心(1) 随笔(1) 题解(8) 验证码(1)

/ 注册

全部文章（共49篇）

POJ1141 ZOJ1463 Brackets Sequence【区间dp】

Description Let us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence. 2. If S i...

dp poj

2016-04-26

0 787

HDU 4293 Groups【区间dp】

Submit Status Description 　　After the regional contest, all the ACMers are walking alone a very long avenue to the dining hall in grou...

dp 杭电

2016-04-29

0 612

HDU 4745 Two Rabbits【非连续最长回文子序列，区间DP】

Submit Status Description Long long ago, there lived two rabbits Tom and Jerry in the forest. On a sunny afternoon, they planned to pl...

dp hdu

2016-05-06

0 668

hdu5188zhx and contest [01背包至少li才能。。。]

Description As one of the most powerful brushes in the world, zhx usually takes part in all kinds of contests. One day, zhx takes part ...

dp acm hdu

2016-05-20

0 573

hdu4882ZCC Loves Codefires【贪心】2014多校联合

ZCC Loves Codefires Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1398 Accepted Submiss...

acm dp 2014多校联合

2016-06-25

0 656

Gym 101102D Rectangles 【单调栈】

Description standard input/output Given an R×C grid with each cell containing an integer, find the number of subrectangles in this g...

acm 优化 dp

2016-10-04

0 694

leetcode 91. Decode Ways

简单dp 感觉自己越来越差了==可能本来就是这个水平吧orz 能想到dp[i]=dp[i-1]+dp[i-2]但是写不明白，20+行的代码还要找标称其实如果想着判断两位字符是用函数封装一下，问题就是so easy 单独一位的不合法的情况只有为'0' 两位的是大于>27 如果遍历到某一位发现d...

leetcode 动态规划 dp

2018-04-10

0 728

leetcode 62 Unique Paths 62 Unique Paths 62 Unique Paths 【走格子简单dp】

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 ...

leetcode dp

2018-10-28

0 584

leetcode300. Longest Increasing Subsequence

https://leetcode.com/problems/longest-increasing-subsequence/ Given an unsorted array of integers, find the length of longest increasing subsequence....

dp

2019-07-07

0 642