02 2019 档案

博弈dp 以I Love this Game! POJ - 1678 为例
摘要：写在前面的话 知识基础：一些基础的博弈论的方法，动态规划的一些知识 前言：博弈论就是一些关于策略或者游戏之间的最优解，动态规划就是对于一些状态之间转移的一些递推式（or 递归），dp分为很多很多种，比如状压dp我感觉其实就是一种暴力，数位dp也可以用记忆化搜索的形式解决。可见动态规划其实是解决一些不 阅读全文
posted @ 2019-02-26 21:34 千摆渡Qbd 阅读(281) 评论(0) 推荐(0)
kuangbin 最小生成树
摘要：A & M - Jungle Roads HDU - 1301 题意：字母之间的路，求最小生成树 题解：处理好建边以后就是一个Prime #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #includ 阅读全文
posted @ 2019-02-19 19:54 千摆渡Qbd 阅读(277) 评论(0) 推荐(0)
Infinite Maze CodeForces - 196B
摘要：We've got a rectangular n × m-cell maze. Each cell is either passable, or is a wall (impassable). A little boy found the maze and cyclically tiled a p 阅读全文
posted @ 2019-02-18 20:51 千摆渡Qbd 阅读(298) 评论(0) 推荐(0)
Alice’s Stamps HDU - 6249 (区间DP）
摘要：点击传送 Alice’s Stamps Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1448 Accepted Submission(s): 阅读全文
posted @ 2019-02-18 18:59 千摆渡Qbd 阅读(219) 评论(0) 推荐(0)
状压DP详解（位运算）
摘要：前言： 状压DP是一种非常暴力的做法（有一些可以排除某些状态的除外），例如dp[S][v]中，S可以代表已经访问过的顶点的集合，v可以代表当前所在的顶点为v。S代表的就是一种状态（二进制表示），比如 (11001)2 代表在二进制中{0，3，4}三个顶点已经访问过了，(11001)2 代表的十进制数 阅读全文
posted @ 2019-02-18 10:50 千摆渡Qbd 阅读(3766) 评论(0) 推荐(3)
E - Nature Reserve CodeForces - 1059D
摘要：传送门 There is a forest that we model as a plane and live nn rare animals. Animal number iihas its lair in the point (xi,yi)(xi,yi). In order to protect 阅读全文
posted @ 2019-02-17 18:16 千摆渡Qbd 阅读(191) 评论(0) 推荐(0)
Ball CodeForces - 12D
摘要：传送门 N ladies attend the ball in the King's palace. Every lady can be described with three values: beauty, intellect and richness. King's Master of Cer 阅读全文
posted @ 2019-02-17 10:20 千摆渡Qbd 阅读(250) 评论(0) 推荐(0)
Reward HDU - 2647
摘要：传送门 Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a trouble a 阅读全文
posted @ 2019-02-16 23:18 千摆渡Qbd 阅读(194) 评论(0) 推荐(0)
Choosing Capital for Treeland CodeForces - 219D （树形DP）
摘要：传送门 The country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall there are n - 1 roads in the countr 阅读全文
posted @ 2019-02-16 23:05 千摆渡Qbd 阅读(230) 评论(0) 推荐(0)
Robots Gym - 101915G
摘要：传送门 The Robotics Olympiad teams were competing in a contest. There was a tree drawn on the floor, consisting of n nodes and n - 1 edges. The nodes are 阅读全文
posted @ 2019-02-16 10:24 千摆渡Qbd 阅读(195) 评论(0) 推荐(0)
Drazil and Tiles CodeForces - 516B （类拓扑）
摘要：Drazil created a following problem about putting 1 × 2 tiles into an n × m grid: "There is a grid with some cells that are empty and some cells that a 阅读全文
posted @ 2019-02-15 20:28 千摆渡Qbd 阅读(247) 评论(0) 推荐(0)
Jongmah CodeForces - 1110D
摘要：传送门 题意：你有n个数字，范围[1, m]，你可以选择其中的三个数字构成一个三元组，但是这三个数字必须是连续的或者相同的，每个数字只能用一次，问这n个数字最多构成多少个三元组? 题解：三个一模一样的顺子等于三个对子（三张） 阅读全文
posted @ 2019-02-15 18:47 千摆渡Qbd 阅读(145) 评论(0) 推荐(0)
Multiplication Puzzle ZOJ - 1602
摘要：Multiplication Puzzle ZOJ - 1602 传送门 The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the mo 阅读全文
posted @ 2019-02-15 09:31 千摆渡Qbd 阅读(207) 评论(0) 推荐(0)