摘要：
题目 "vijos1755" "luogu1074" 题解 从右下角开始倒搜，顺搜会被卡，然后。。。就是特别暴力特别暴力的搜。。。 vijos AC，luogu T了一个点，我果然还是比较菜 代码 c++ include include include include include using n 阅读全文
摘要：
题目 "vijos1909" 题解 先从终点反向bfs一遍，找出所有无法到达终点的点，那么这些点的上一个点均不能放入路径中，标记下来，最后从起点bfs满足条件的点，得到最短路径 代码 include include include include include include include in 阅读全文
摘要：
题目 "luogu1053" "vijos1008" 代码 只会写O(n^2)的程序，看了黄学长的代码，比较巧妙，也许自己应该再多想一下的？ include include include include include include define N 50005 using namespace 阅读全文
摘要：
题目 "vijos1906" "luogu1351" 代码 ps.本来看到n 1条边第一反应就是建树，奈何水平太差一直T，最终只得感叹：“ 暴力出奇迹 ” 代码 include include define N 400005 define mod 10007 define ll long long 阅读全文
摘要：
题目 "vijos1737" 题解 用ans[i]记录1~i中能与i组合的客栈总数 那么对于色调相同且距离最近的i,j (i include include include include include define N 200005 using namespace std; int n,k,p, 阅读全文
摘要：
题目 "luogu2346" 题解 迭代深搜 注意黑白双方交替走棋(TAT...) 代码 include using namespace std; const int fx[5] = {1, 1, 0, 0}; const int fy[5] = {0, 0, 1, 1}; const char t 阅读全文
摘要：
题目 "luogu2659" 代码 1 以每个数为最小值，向左右扫出区间，加一点小优化 include include include include include include define N 2000005 using namespace std; int n,a[N],l[N],r[N] 阅读全文
摘要：
题目 "luogu1006" "vijos1493" 代码 include include include include include include define N 60 using namespace std; int n,m,mp[N][N]; int f[N][N][N][N];//f 阅读全文
摘要：
题目 "vijos1642" 普通dp 按照 "黄学长" 的说法，直接dp会超时，下附上我的80分代码 include include include include include define N 1005 using namespace std; int n,m,a[N],f[N][N]; s 阅读全文
摘要：
题目 "codevs1427" 数据太水，只有一个测试点，可以在 "RQNOJ204" 上交 题解 双线dp 显然，从i点到j点的最小差值和为abs(a[i] a[j]),存于dis[i][j]中 因为同一条路从左到右和从右到左所得的差值之和是相同的，不妨将所有路都看做从左到右走的，那么题意转化为求 阅读全文
摘要：
简单版 "luogu3808" ps.第一次写，不太美观，加强版的好看些 代码 include include include include include include include define N 1000005 using namespace std; int n,ans; int t 阅读全文
摘要：
题目 "luogu3384" 代码 include include include include include include define N 1000005 define ll long long using namespace std; int n,m,root,mod; int w[N] 阅读全文
摘要：
题目 "luogu3379" ST表求LCA include include include include include include define N 1000005 using namespace std; int n,m,root,f[N][25]; int num,a[N],b[N], 阅读全文
摘要：
题目 "luogu3865" 代码 include include include include include include define N 100005 using namespace std; int n,m; int f[N][20]; int main() { scanf("%d%d 阅读全文
摘要：
题目 "bzoj2428" 题解 模拟退火，RP算法玄学骗分 循环的次数真的是......... 多算几遍答案就很稳，超时也很稳，少算几遍答案抖得辣么惊悚，却是玄学地AC了......但考试的时候这么抖的答案怎么敢交啊 T^T(非酋流下了伤心的泪水) 代码 include include inclu 阅读全文