neuike的博客

Paint ChainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1741 Accepted Submission(s): 595Problem Description Aekdycoin and abcdxyzk are p

Stone Game, Why are you always there?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 726 Accepted Submission(s): 250Problem Description “Al

hdu 3197 题意： 给一棵树，两个人每次砍树干，最后没得砍的那个人输，试着判断谁输谁赢。TIP： 输入很坑，-1代表该点就在地上。 思路： 树形博弈，递归求解sg值即可。NIM博弈。 代码：#include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<queue> #include<map>

博弈+状态压缩。感觉其实更像是模拟整个操作过程，每一步都保证达到最优。 然后进行状态转移就好啦。 需要注意的是 数组开小了真的是什么错误都会报，T RE WA都可能出现。。#include<cstdio> #include<cstring> #include<algorithm> using namespace std;int g,b,s; int dp[1<<21]; int num[3