BMan、 - 博客园

usaco Number Triangles DP

摘要： DP入门题。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define pb(a) push(a)#defi 阅读全文

posted @ 2014-02-20 17:14 BMan、阅读(206) 评论(0) 推荐(0)

usaco Arithmetic Progressions

摘要：预处理全部q2+p2有20000多个。枚举任意两个的差，并以这个差扩展找到连续的有几个为了避免重复浪费时间，只需判断无法向左扩展的一对数，具体见代码。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typed 阅读全文

posted @ 2014-02-20 16:31 BMan、阅读(206) 评论(0) 推荐(0)

usaco the clocks DFS

摘要：迭代加深搜索，预处理9个move.//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define pb(a) p 阅读全文

posted @ 2014-02-20 14:12 BMan、阅读(190) 评论(0) 推荐(0)

usaco Packing Rectangles

摘要：太恶心了//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define pb(a) push(a)#define 阅读全文

posted @ 2014-02-18 16:32 BMan、阅读(210) 评论(0) 推荐(0)

LightOj 1016 - Brush (II) 排序贪心

摘要：按Y轴排序后贪心//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define pb(a) push(a)#de 阅读全文

posted @ 2014-02-18 10:11 BMan、阅读(230) 评论(0) 推荐(0)

uva 127 "Accordian" Patience 简单模拟

摘要： #include#include#include#include#include#include#includeusing namespace std;char da[55][55][5];int num[55];int pilenum;void erase(int idx){ for(int i=idx;i3) { if(da[i][num[i]][0]==da[i-3][num[i-3]][0]|| da[i][num[i]][1]==da[i-3][num[i-3]][1]) { ... 阅读全文

posted @ 2014-02-17 11:06 BMan、阅读(147) 评论(0) 推荐(0)

hdu 1180 诡异的楼梯 BFS + 优先队列

摘要： //#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define pb(a) push(a)#define INF 阅读全文

posted @ 2013-12-15 12:51 BMan、阅读(200) 评论(0) 推荐(0)

UVALive 3907 Puzzle AC自动机+DP

摘要： 10天前交的题，当时OJ挂了，现在才想起去看结果。如果在状态上深搜的过程中出现了环，说明可以无限长。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull 阅读全文

posted @ 2013-12-02 13:21 BMan、阅读(251) 评论(0) 推荐(0)

HDU 4001 To Miss Our Children Time DP

摘要：排序后DP，注意要用long long 的地方。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define 阅读全文

posted @ 2013-11-22 16:53 BMan、阅读(173) 评论(0) 推荐(0)

HDU 4000 Fruit Ninja 树状数组

摘要：求逆序对的加强版.先求出 x#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define lson idx T min(const T& a,const T 阅读全文

posted @ 2013-11-21 20:52 BMan、阅读(200) 评论(0) 推荐(0)

夏夜、