micsay的博客

题干DescriptionFarmer 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. R

题干走你题解#include<cstdio> #include<cstring> #define max(x,y) (x) > (y) ? (x) : (y) #define min(x,y) (x) < (y) ? (x) : (y)bool equal(char s[],int i,int j){ return (s[i]== '(' && s[j] == ')') || (s[i] ==

学习资源1.瞿老师给的动态规划题目以及讲解的链接：http://blog.jobbole.com/96364/2.解决动态规划问题，要先找出动态转移方程来，动态转移方程怎么找呢？首先得定好，用哪几个因子，可以明确的表示好一个状态，然后，再通过样例或者特例或者硬想，找出子问题和父问题的关系，或者说，子问题怎么push，可以影响到父问题？我感觉可以放开思路想，放心大胆的想，假设你不会动态规划，让你暴力搜

题干走你题解/** *比较经典的树形dp *跑两次深搜，都是从根1开始搜索，第一次深搜获得最大子树， *第二次深搜是在第一次深搜的基础上，进行dp操作，获得最终结果 *一个结点最终的结果，可能来自于这个结点的父亲，也可能来自这个结点的儿子，而儿子在第一次深搜 *的时候就得出来了，所以应该从上往下搜出来自父亲的最大权值来决定是否再次更新 */ #include<cstdio> #include<vec

列表一：经典题目题号： 容易： 1018, 1050, 1083, 1088, 1125, 1143, 1157, 1163, 1178, 1179, 1189, 1191,1208, 1276, 1322, 1414, 1456, 1458, 1609, 1644, 1664, 1690, 1699, 1740, 1742, 1887, 1926, 1936, 1952, 1953, 1

??Description“Fat and docile, big and dumb, they look so stupid, they aren’t much fun…” - Cows with Guns by Dana Lyons The cows want to prove to the public that they are both smart and fun. In orde

题干Problem Description The title of this problem is familiar,isn’t it?yeah,if you had took part in the “Rookie Cup” competition,you must have seem this title.If you haven’t seen it before,it doesn’t ma

题干DescriptionA numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), where 1 <= i1 < i2 < … < iK <

题干DescriptionGigel has a strange “balance” and he wants to poise it. Actually, the device is different from any other ordinary balance. It orders two arms of negligible weight and each arm’s length i

题干走你题解/** *数位dp，转移方程很好想，需要仔细考虑的是，怎样通过计算出来的dp数组 *得出结果，也就是本题目里面的work()函数，我写的有点乱，但是好在AC了 */ #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int dp[10][10]; int work(int n){