摘要：
又到了一年一度~~ "Dick尻" 和 "李尻尻" 交配~~的停课时间了。 PMYCQACF又变菜了，天天被吊打。 考试日志 $10.17$ 今天的题目不是很难,但是做的情况不好,还是思维能力不够. $10.18$ 咕咕咕，今天和学哥一起咕了T1，其实T1并不难，但是不能够自己想出来，被一眼$CDQ 阅读全文
posted @ 2018-10-17 21:56
cj_gjh
阅读(300)
评论(5)
推荐(0)
摘要：
题面 "原题" Solution cpp include include include include include include include define ll long long define file(a) freopen(a".in","r",stdin);freopen(a".o 阅读全文
posted @ 2018-10-28 22:21
cj_gjh
阅读(190)
评论(0)
推荐(0)
摘要：
题面 "原题" Solution cpp include include include include include include include define ll long long define re register using namespace std; inline int gi 阅读全文
posted @ 2018-10-28 22:20
cj_gjh
阅读(155)
评论(0)
推荐(0)
摘要：
题面 "原题" Solution 考虑对于每一个环一定是满足要求的，那么他在这个环内而且所有的奶牛都要喜欢它，所以他一定没有出边且这个环是唯一的。 cpp include include include include include include include define ll long l 阅读全文
posted @ 2018-10-28 22:17
cj_gjh
阅读(96)
评论(0)
推荐(0)
摘要：
Splay是平衡树的变种之一，希望大家不要掌握~~按照Anson的说法，能不写平衡树就不写~~ cpp include include include include include using namespace std; int n,m; class BST{ private: struct n 阅读全文
posted @ 2018-10-25 21:32
cj_gjh
阅读(543)
评论(0)
推荐(0)
该文被密码保护。 阅读全文
posted @ 2018-10-24 21:15
cj_gjh
阅读(1)
评论(0)
推荐(0)
摘要：
题面 "原题" Solution 显然可以发现这道题目可以树形Dp？ 那么我们也可以考虑别的东西比如说直径？ 因为我们知道直径是一条链？ 所以就可以抠出来这一条链然后再加？ 你问我这样子为什么过？ 因为你考虑如果存在一个别的不属于直径的链，显然不能使答案变长？ 于是就可以这么愉快地做了？ cpp i 阅读全文
posted @ 2018-10-24 21:12
cj_gjh
阅读(223)
评论(0)
推荐(0)
摘要：
题面 "原题" Solution 据说本题可以分层图+SPFA过？反正我没有尝试，直接Dp不就好了吗？QAQ cpp // luogu judger enable o2 include include include include include include include define ll 阅读全文
posted @ 2018-10-24 15:27
cj_gjh
阅读(174)
评论(0)
推荐(0)
摘要：
前言 因为今天考试不会Hash然后只会yy结论，于是决定苦练Hash。。。 题面 "原题" Solution 考虑可以把每一个东西都搞出来，然后处理一下Hash关系就好了。。。 cpp include include include include include include include d 阅读全文
posted @ 2018-10-23 21:57
cj_gjh
阅读(313)
评论(0)
推荐(0)
摘要：
题目 "原题" Solution 看到数据范围就可以想到状压，然后你就可以直接转移就好了？ cpp include include include include include include include define ll long long define file(a) freopen(a 阅读全文
posted @ 2018-10-23 21:23
cj_gjh
阅读(149)
评论(0)
推荐(0)
摘要：
原题 "洛谷" "BZOJ" Solution 这道题目不是看到就发现是一道树链剖分的裸题吗？ cpp include include define ll long long ll max(ll a,ll b){ if(a b)return a; return b; } void swap(int 阅读全文
posted @ 2018-10-22 22:18
cj_gjh
阅读(145)
评论(0)
推荐(0)
浙公网安备 33010602011771号