1262934560的博客

就明白了个模板题，先放个模板。多做一些题后在来整理下。#pragma GCC optimize(3,"Ofast","inline") //G++#include<bits/stdc++.h>#define mem(a,x) memset(a,x,sizeof(a))#define debug(x) cout << #x << ": " <...

树的直径【定义】我们将一棵树T = ( V，E )的直径定义为maxδ ( u，v ) ( u，v ∈ V )，也就是说，树中所有最短路径距离的最大值即为树的直径。poj1985-添加链接描述【做法】做法1：2遍DFS先从任意一点P出发，找离它最远的点Q，再从点Q出发，找离它最远的点W，W到Q的距离就是是的直径。DFS从当前节点出发到达最远的点第一次DFS返回的point肯定是直径...

CF-1237D(Balanced Playlist)好题题目描述Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of n tracks numbered from 1 to n. The p...

Elven Postman(HDU5444 二叉查找树)题目描述Elves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, they live...