【BZOJ 3242: [Noi2013]快餐店】树形dp，要么最远点在同一颗树上（dp），要么在不同树上，此时答案=去掉任何一条边
A. 暴力#include<bits/stdc++.h>using namespace std;#define#define#define#define#define#define#define#define#define#define#define#define#define#define#define#define#define#define#define#define#defi
day 0:今天晚上5：30pm，和wwx和qyl一起去了机场
Uncow #include<algorithm> #include<functional> #include<iostream> #include<cmath> #include<cctype> #include<ctime> using namespace std; #def
time/min solution POJ 1753 Flip Game 20min 枚举 poj1753#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<functional> #include<iostrea
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
