【树链剖分】
关注
分享
扫一扫
文章平均质量分 85
Gijkstra
Can we do better?
展开
-
HDU 5052 Yaoge’s maximum profit（树剖+区间合并)
Yaoge’s maximum profit Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1321 Accepted Submission(s): 418 Problem Description Yao...原创 2018-05-08 17:01:06 · 186 阅读 · 0 评论 -
POJ3237 Tree(树剖)
TreeTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 11539 Accepted: 2977DescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 ...原创 2018-04-27 15:34:39 · 173 阅读 · 0 评论 -
hdu 4718 The LCIS on the Tree(树剖+区间合并)
The LCIS on the TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1470 Accepted Submission(s): 422Problem DescriptionFor a sequence S1, S2,...原创 2018-05-08 17:24:55 · 277 阅读 · 0 评论 -
uva 12655 Trucks(树剖+MST)
题目链接：点击打开链接题意：给出n个点，m条双向边，每个边都有个权值（这个路可以通行的最大重量），然后有q个查询，每次查询u到v上最大可以运输多少重量（每次只从u出发一辆车）分析：为使u到v运输重量最大，那么就要使u到v路径上最小的边尽量大，于是这里可以搞个最大生成树，这样就使得每一条边尽量大了，然后根据最大生成树建LCT，查询即可#include<bits/stdc++.h> usi...原创 2018-05-08 17:39:59 · 271 阅读 · 0 评论 -
hdu 5029 Relief grain(树剖好题)
Relief grainTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 3085 Accepted Submission(s): 903Problem DescriptionThe soil is cracking up bec...原创 2018-05-08 17:58:58 · 304 阅读 · 0 评论 -
bzoj 3531 旅行 (树剖+动态建树)
3531: [Sdoi2014]旅行Time Limit: 40 Sec Memory Limit: 512 MBSubmit: 2990 Solved: 1318[Submit][Status][Discuss]Description S国有N个城市，编号从1到N。城市间用N-1条双向道路连接，满足从一个城市出发可以到达其它所有城市。每个城市信仰不同的宗教，如飞天面条神教、隐形独角兽教、绝地...原创 2018-05-08 18:09:27 · 171 阅读 · 0 评论