感觉前面做了那么多$dp$全是自己想的还是太少啊…… 好像在LZT的博客上看到了不错的资源?赶紧开坑,以一句话题解为主 Codeforces 419B 第一题就开始盗图 由于只有一个交点,手玩一下发现两人的路径可以分为四块区域,且只有两种情况: 预处理四个方向的最长距离,枚举相交点即可 FZU 2234: 将往返路径看成从起点出发的两条路径 $dp[Xa][Xb][STEP]$用三维记录两个当前位置,转移时注意两点是否重复 Tip:建状态时注意是否有能合并的维度! POJ 1050: 一开始想成…

DP Training DP Training 01 https://vjudge.net/contest/220286 密码 nfls A 数塔(Easy) \(f[i][j]\) 表示当前选第 \(i\) 行,第 \(j\) 列的格子,上面的选完了,下面的没选的最大方案 \(f[i][j]=max(f[i-1][j-1],f[i-1][j])+a[i][j]\) B 数塔(Medium) 不难发现答案一定是交点到四个顶点的最大路径之和,预处理 \(f[4][i][j]\) 表示 \((i,j…

炮兵阵地 Time Limit: 2000ms Memory Limit: 65536KB This problem will be judged on PKU. Original ID: 118564-bit integer IO format: %lld      Java class name: Main   司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队.一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"…

B. Collecting Bugs Time Limit: 10000ms Memory Limit: 64000KB 64-bit integer IO format: %lld      Java class name: Main Special Judge   Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects…

一些RL的文献(及笔记) copy from: https://zhuanlan.zhihu.com/p/25770890  Introductions Introduction to reinforcement learningIndex of /rowan/files/rl ICML Tutorials:http://icml.cc/2016/tutorials/deep_rl_tutorial.pdf NIPS Tutorials:CS 294 Deep Reinforcement Lea…

About this Course This course will teach you how to build convolutional neural networks and apply it to image data. Thanks to deep learning, computer vision is working far better than just two years ago, and this is enabling numerous exciting applica…

Big binary tree Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 597    Accepted Submission(s): 207 Problem Description You are given a complete binary tree with n nodes. The root node is numbere…

Colorful Tree Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1539    Accepted Submission(s): 616 Sample Input 3 1 2 1 1 2 2 3 6 1 2 1 3 2 1 1 2 1 3 2 4 2 5 3 6 Sample Output Case #1: 6 Case #…

G. Training Camp[ Color: Yellow ]Montaser is planning to train very hard for ACM JCPC 2015; he has prepared a list with n topicsto study in the next n days, one topic every day.Montaser knows that some topics depend on other topics, so he asked coach…

原题: ZOJ 3684 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3684 题意: 给你一棵树,树的根是树的中心(到其他点的最远距离最小).现在你要破坏所有叶子节点到根节点的连通,每条边破坏都需要一定能量.你有一个能量为power的武器,能破坏能量小于等于power的任何路.求最少需要的power. 解法参考博客:http://blog.csdn.net/gzh1992n/article/details/86511…