状压dp
文章平均质量分 77
闻道-问道
这个作者很懒,什么都没留下…
展开
-
Tourism Planning (状态dp)
Several friends are planning to take tourism during the next holiday. They have selected some places to visit. They have decided which place to start their tourism and in which order to visit these pl原创 2017-12-10 19:20:37 · 207 阅读 · 0 评论 -
#1794 : 拼三角形(状压dp)
#1794 : 拼三角形时间限制:20000ms单点时限:1000ms内存限制:256MB描述给定 n 根木棍,第 i 根长度为 ai现在你想用他们拼成尽量多的面积大于 0 的三角形,要求每根木棍只能被用一次,且不能折断请你求出最多能拼出几个输入第一行一个正整数 n第二行 n 个正整数 a1 … an1 ≤ n ≤ 151 ≤ ai ≤ 109输...原创 2018-08-04 23:33:06 · 298 阅读 · 0 评论 -
Corn Fields (状态dp)
Farmer John has purchased a lush new rectangular pasture composed of M byN (1 ≤M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably,原创 2017-12-10 19:32:14 · 345 阅读 · 0 评论 -
Mondriaan's Dream (状态dp)
Squares 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, for all of h原创 2017-12-03 23:36:56 · 254 阅读 · 0 评论 -
Necklace (状态dp)
One day , Partychen gets several beads , he wants to make these beads a necklace . But not every beads can link to each other, every bead should link to some particular bead(s). Now , Partychen wants原创 2017-12-11 00:00:58 · 391 阅读 · 3 评论 -
Pieces (状态dp)
You heart broke into pieces.My string broke into pieces.But you will recover one day,and my string will never go back.Given a string s.We can erase a subsequence of it if this subsequence is palin原创 2017-12-10 21:16:14 · 259 阅读 · 0 评论 -
方格取数(1) (状态dp)
给你一个n*n的格子的棋盘,每个格子里面有一个非负数。 从中取出若干个数,使得任意的两个数所在的格子没有公共边,就是说所取的数所在的2个格子不能相邻,并且取出的数的和最大。 Input包括多个测试实例,每个测试实例包括一个整数n 和n*n个非负数(nOutput对于每个测试实例,输出可能取得的最大的和Sample Input375 15 21 75 15 28 34 70 5原创 2017-12-10 21:02:16 · 451 阅读 · 0 评论 -
Doing Homework (状态dp)
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after th原创 2017-12-10 20:49:31 · 345 阅读 · 1 评论 -
Long Dominoes (状态dp)
Find the number of ways to tile an m*n rectangle with long dominoes -- 3*1 rectangles.Each domino must be completely within the rectangle, dominoes must not overlap (of course, they may touch each o原创 2017-12-10 20:38:13 · 247 阅读 · 0 评论 -
Most Powerful (状态dp)
Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears and a lot of power原创 2017-12-10 20:27:35 · 250 阅读 · 0 评论 -
Survival (状态dp)
The King of Fighter 97 (KOF97) is an electronic game of wrestling type. Once it was fashionable among youths. The game is amused. However, playing by oneself is not as excited as with friends. Getting原创 2017-12-10 20:15:43 · 227 阅读 · 0 评论 -
Hie with the Pie (状态dp)
The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries. He will wait原创 2017-12-10 20:02:19 · 263 阅读 · 0 评论 -
炮兵阵地 (状态dp)
司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示:如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色的网格表示它能够攻击到原创 2017-12-10 19:45:04 · 246 阅读 · 0 评论 -
调查问卷(状压)
Problem Description度度熊为了完成毕业论文,需要收集一些数据来支撑他的论据,于是设计了一份包含 mm 个问题的调查问卷,每个问题只有 'A' 和 'B' 两种选项。将问卷散发出去之后,度度熊收到了 nn 份互不相同的问卷,在整理结果的时候,他发现可以只保留其中的一部分问题,使得这 nn 份问卷仍然是互不相同的。这里认为两张问卷是不同的,当且仅当存在至少一个被保留的问题在这...原创 2018-08-05 10:48:43 · 273 阅读 · 0 评论