F - Prime PathPOJ - 3126The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their of

【代码】redux学习1。

白书上给了个目前没什么用的解法，用dp[0][j]和dp[1][j]保存两个状态，利用&运算符不停滚动更新，这个虽然不如一维的开销小，但是以后也许会用的到，思路奇妙#include<iostream>#include<cstring>#include<cstdio>#include<a

POJ - 3279不会做。但是感觉思路挺有意思的大体的思路是：把第一行状态确定好了，之后的每一行都由前一行决定，也就是之后的所有状态都确定好了，此时枚举第一行的状态，看看根据该情况最后一行是否能符合情况，难点就是状态的压缩，也是比较基础的地方了，主要还是难想，对就是菜。。。#include<iostream>#include<cstring&gt

https://vjudge.net/problem/POJ-2117tarjan终极模板solve()：求桥solve1()：求割点solve2()：求去掉一个点后联通块数#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#inc...

之前用暴力和优先队列做过，但是太占内存最好的方法还是用vector不停地更新入度删边，比较容易理解#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<vector&am

http://codeforces.com/contest/1066/submission/46841921#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<vect

http://codeforces.com/contest/1061/problem/A简单手速题，对以后不叫水题了，叫手速题#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include&am