树分治
qdu_ellery
我有梦想啊!
展开
-
Tree POJ - 1741(树分治模板)
Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give an integer k,for every pair (u,v) of vertices is calle...原创 2019-09-22 18:35:45 · 112 阅读 · 0 评论 -
bzoj 2152: 聪聪可可(树分治)
2152: 聪聪可可 Time Limit: 3 Sec Memory Limit: 259 MB Submit: 5933 Solved: 3156 [Submit][Status][Discuss] Description 聪聪和可可是兄弟俩,他们俩经常为了一些琐事打起来,例如家中只剩下最后一根冰棍而两人都想吃、两个人都想玩儿电脑(可是他们家只有一台电脑)……遇到这种问题,一般情况下石头剪...原创 2019-09-22 20:41:54 · 162 阅读 · 0 评论 -
Fish eating fruit 点分治
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> using namespace std; #define rep(a,b,c) for(int a=b;a<=c;a++) void _swap(int &x,int &y){x^...原创 2019-09-22 21:34:57 · 123 阅读 · 0 评论 -
Codeforces 161D Distance in Tree(树的点分治)
A tree is a connected graph that doesn’t contain any cycles. The distance between two vertices of a tree is the length (in edges) of the shortest path between these vertices. You are given a tree with...原创 2019-09-25 17:24:14 · 179 阅读 · 0 评论