欢迎来到蒟蒻ｍqd的博客

随笔分类 -  倍增

2019牛客暑期多校训练营（第三场）F Planting Trees 单调队列
摘要：F Planting Trees 题目链接 https://ac.nowcoder.com/acm/contest/883/F 题目描述 The semester is finally over and the summer holiday is coming. However, as part o 阅读全文
posted @ 2019-07-25 23:13 mmqqdd 阅读(416) 评论(0) 推荐(0)
BZOJ 3732: Network 最小生成树 倍增
摘要：3732: Network 题目连接： http://www.lydsy.com/JudgeOnline/problem.php?id=3732 Description 给你N个点的无向图 (1 <= N <= 15,000)，记为：1…N。 图中有M条边 (1 <= M <= 30,000) ，第 阅读全文
posted @ 2019-05-09 12:09 mmqqdd 阅读(159) 评论(0) 推荐(0)
Codeforces Round #371 (Div. 1) D. Animals and Puzzle 二维倍增
摘要：D. Animals and Puzzle 题目连接： http://codeforces.com/contest/713/problem/D Description Owl Sonya gave a huge lake puzzle of size n × m to hedgehog Filya 阅读全文
posted @ 2019-05-09 10:23 mmqqdd 阅读(186) 评论(0) 推荐(0)
Manthan, Codefest 16 E. Startup Funding ST表 二分 数学
摘要：html {overflow x: initial !important;}:root { bg color: ffffff; text color: 333333; select text bg color: B5D6FC; select text font color:auto; monospa 阅读全文
posted @ 2019-05-08 19:02 mmqqdd 阅读(504) 评论(0) 推荐(0)
HDU 5289 Assignment rmq
摘要：Assignment 题目连接： Description Tom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff 阅读全文
posted @ 2019-05-08 10:08 mmqqdd 阅读(182) 评论(0) 推荐(0)
Codeforces Educational Codeforces Round 3 E. Minimum spanning tree for each edge　树上倍增
摘要：E. Minimum spanning tree for each edge 题目连接： Description Connected undirected weighted graph without self loops and multiple edges is given. Graph con 阅读全文
posted @ 2019-05-07 23:14 mmqqdd 阅读(175) 评论(0) 推荐(0)
HDU 4123 Bob’s Race　树的直径＋ST表
摘要：Bob’s Race Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=4123 Description Bob wants to hold a race to encoura 阅读全文
posted @ 2019-05-07 19:18 mmqqdd 阅读(248) 评论(0) 推荐(0)
poj 3264 Balanced Lineup RMQ问题
摘要：Balanced Lineup Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://poj.org/problem?id=3264 Description For the daily milking, Farmer John's N cows (1 阅读全文
posted @ 2019-04-23 22:20 mmqqdd 阅读(156) 评论(0) 推荐(0)