![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
Wang_rush
这个作者很懒,什么都没留下…
展开
-
POJ 3254 Corn Fields (状压DP)
Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, ...原创 2020-01-09 16:38:21 · 145 阅读 · 0 评论 -
POJ 2411 Mondriaan's Dream (状压DP)
DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his ‘toilet series’ (where he had to use his toilet paper to draw on, ...原创 2020-01-09 14:59:19 · 139 阅读 · 0 评论 -
HDU 3652 B-number(数位DP)
Time Limit: 1000 MS Memory Limit: 65536 KDescriptionA wqb-number,or B-number for short,is a non-negative integer whose decimal form containthe substring “13” and can be divided by 13.For example...原创 2020-01-08 20:11:18 · 143 阅读 · 0 评论 -
HDU - 3555 Bomb(数位dp)
The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence inc...原创 2020-01-08 18:58:41 · 120 阅读 · 0 评论 -
POJ 3252 Round Numbers(数位DP)
The cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone’ (also known as ‘Rock, Paper, Scissors’, ‘Ro, Sham, Bo’, and a host of other names) in order to make...原创 2020-01-08 16:01:23 · 115 阅读 · 0 评论 -
HDU 2196 Computer(树形dp)
ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6493 Accepted Submission(s): 3274Problem DescriptionA school bought the first com...原创 2020-01-07 20:58:03 · 99 阅读 · 0 评论 -
POJ 2486:Apple Tree(树形DP)
Apple TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7789 Accepted: 2606DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. The...原创 2020-01-07 20:42:43 · 175 阅读 · 1 评论 -
codeforces 148D Bag of mice(概率dp)
The dragon and the princess are arguing about what to do on the New Year’s Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they sh...原创 2020-01-06 21:03:36 · 149 阅读 · 0 评论 -
最长上升子序列O(nlogn)算法
#include<cstdio>#include<algorithm>using namespace std;int a[40005];int lis[40005];int main(){ int n; scanf("%d",&n); for (int i=1;i<=n;i++) scanf("%d",&am...原创 2019-07-19 19:21:36 · 641 阅读 · 0 评论