loi_王振东

题目>>http://codevs.cn/problem/2460/#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int MAXN = 1e6 + 5;typedef long long ll;ll n,a,b,num[MAXN],q,fir

题目>>https://www.luogu.org/problem/show?pid=3384#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;typedef long long ll;const int MAXN = 1e6 + 5;ll n,a,b,c,

题目>>http://codevs.cn/problem/2370/#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>using namespace std;const int MAXN = 2e5;struct zt{ int deep,num,dis,;

由于不太会打bfs，这题用的dfs。通过这道题还是学到了蛮多的东西的。首先，瞎打一气（dfs + 标记走过的点）40分。 代码如下：#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int X[] = {0,1,0,-1};const int Y