## poj 3249 Test for Job (拓扑排序+dp)

http://poj.org/problem?id=3249

# 思路：

## leetcode 152. Maximum Product Subarray (最大连续子序列乘积，dp)

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given[……]

## leetocde 63. Unique Paths II

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty[……]

## leetcode 64. Minimum Path Sum (二维dp)

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numb[……]

## 2748: [HAOI2012]音量调节

Time Limit: 3 Sec  Memory Limit: 128 MB
Submit: 1814  Solved: 1148
[Submit][Status][Discuss]

## 1207: [HNOI2004]打鼹鼠

Time Limit: 10 Sec  Memory Limit: 162 MB
Submit: 2854  Solved: 1390
[Submit][Status][Discuss]

hdu1864题目链接

## 1009: [HNOI2008]GT考试

Time Limit: 1 Sec  Memory Limit: 162 MB
Submit: 3127  Solved: 1926
[Submit][Status][Discuss]

阿申准备报[……]

## [dp专题000]uva 10328 Coin Toss (java 大数+dp)（Unsolved）

dp[i][j]表示长度为i，前面最后连续的‘H’的个数不超过j个的方案[……]