12 2017 档案

洛谷P2073送花
摘要：#include<cstdio> #define mid(l,r) ((l+r)/2) #define MXN 10000+1 #define nil 0 #define alpha 0.7f int read(){ int x=0; bool w=1; char c=getchar(); whil 阅读全文
posted @ 2017-12-26 17:02 Halifuda 阅读(151) 评论(0) 推荐(0)
替罪羊树
摘要：#include<cstdio> #include<ctime> #define mid(l,r) ((l+r)/2) #define max(a,b) (a>b?a:b) #define min(a,b) (a<b?a:b) #define nil 0 #define alpha 0.75f #d 阅读全文
posted @ 2017-12-23 01:47 Halifuda 阅读(295) 评论(0) 推荐(0)
子树大小平衡树
摘要：#include<cstdio> #define MXN 100000+3 #define max(a,b) (a>b?a:b) #define min(a,b) (a<b?a:b) #define nil 0 #define LEFT false #define RIGHT true int va 阅读全文
posted @ 2017-12-22 22:43 Halifuda 阅读(516) 评论(0) 推荐(0)
NOIP2017D1T3逛公园——哎呦！
摘要：#include<cstdio> #include<cstring> #define MXN 100001 #define MXM 200001 #define MXK 51 int afst[MXM],anxt[MXM],av[MXM],aw[MXM]; int bfst[MXM],bnxt[MX 阅读全文
posted @ 2017-12-08 21:22 Halifuda 阅读(161) 评论(0) 推荐(0)
可持久化数组·放弃尊严
摘要：#include<cstdio> #define MXN 1000000+1 #define mid(a,b) ((a+b)>>1) int read(){ int x=0,w=1; char c=getchar(); while(c<'0'||c>'9'){ if(c=='-') w=-1; c= 阅读全文
posted @ 2017-12-02 16:06 Halifuda 阅读(150) 评论(0) 推荐(0)
可持久化数组
摘要：#include<cstdio> #define MXN 1000000+1 #define mid(a,b) ((a+b)>>1) int read(){ int x=0,w=1; char c=getchar(); while(c<'0'||c>'9'){ if(c=='-') w=-1; c= 阅读全文
posted @ 2017-12-02 15:47 Halifuda 阅读(155) 评论(0) 推荐(0)
洛谷P2286宠物收养场·改
摘要：#include<cstdio> #define abs(a,b) (a>b?a-b:b-a) #define MOD 1000000 #define MXN 80000+5 int read(){ int x=0,w=1; char c=getchar(); while(c<'0'||c>'9') 阅读全文
posted @ 2017-12-01 18:45 Halifuda 阅读(146) 评论(0) 推荐(0)