09 2017 档案

摘要:题目 "vijos1979" 代码 include include include include include include include include define N 200005 define inf 2000000000 using namespace std; int n,sum 阅读全文
posted @ 2017-09-30 16:09 XYZinc 阅读(165) 评论(0) 推荐(0)
摘要:题目 "bzoj1051" 代码 include include include include include include define N 100100 using namespace std; int n,m,ans; int dfn[N],t;//每一个节点被访问的时间戳,即dfs序 i 阅读全文
posted @ 2017-09-30 15:32 XYZinc 阅读(146) 评论(0) 推荐(0)
摘要:题目 "luogu3834" 代码 include include include include define N 500005 define M 10000000 using namespace std; int n,m,rk[N]; int root[N]; struct data{int i 阅读全文
posted @ 2017-09-26 19:18 XYZinc 阅读(144) 评论(0) 推荐(0)
摘要:题目 "luogu2625" 题解 若无角度限制,最远距离就是先向前走完forward,再转180度走backward,有角度限制时,旋转角度越接近180,距离最远(已知三角形两边,夹角越大,第三边越大) 用背包扫出所有可能的角度 代码 include include include include 阅读全文
posted @ 2017-09-25 20:09 XYZinc 阅读(128) 评论(0) 推荐(0)
摘要:题目 "vijos1755" "luogu1074" 题解 从右下角开始倒搜,顺搜会被卡,然后。。。就是特别暴力特别暴力的搜。。。 vijos AC,luogu T了一个点,我果然还是比较菜 代码 c++ include include include include include using n 阅读全文
posted @ 2017-09-23 15:58 XYZinc 阅读(155) 评论(0) 推荐(0)
摘要:题目 "vijos1909" 题解 先从终点反向bfs一遍,找出所有无法到达终点的点,那么这些点的上一个点均不能放入路径中,标记下来,最后从起点bfs满足条件的点,得到最短路径 代码 include include include include include include include in 阅读全文
posted @ 2017-09-22 11:24 XYZinc 阅读(147) 评论(0) 推荐(0)
摘要:题目 "luogu1053" "vijos1008" 代码 只会写O(n^2)的程序,看了黄学长的代码,比较巧妙,也许自己应该再多想一下的? include include include include include include define N 50005 using namespace 阅读全文
posted @ 2017-09-20 19:06 XYZinc 阅读(214) 评论(0) 推荐(0)
摘要:题目 "vijos1906" "luogu1351" 代码 ps.本来看到n 1条边第一反应就是建树,奈何水平太差一直T,最终只得感叹:“ 暴力出奇迹 ” 代码 include include define N 400005 define mod 10007 define ll long long 阅读全文
posted @ 2017-09-19 17:09 XYZinc 阅读(131) 评论(0) 推荐(0)
摘要:题目 "vijos1737" 题解 用ans[i]记录1~i中能与i组合的客栈总数 那么对于色调相同且距离最近的i,j (i include include include include include define N 200005 using namespace std; int n,k,p, 阅读全文
posted @ 2017-09-19 13:09 XYZinc 阅读(183) 评论(0) 推荐(0)
摘要:题目 "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 阅读全文
posted @ 2017-09-16 16:23 XYZinc 阅读(184) 评论(0) 推荐(0)
摘要:题目 "luogu2659" 代码 1 以每个数为最小值,向左右扫出区间,加一点小优化 include include include include include include define N 2000005 using namespace std; int n,a[N],l[N],r[N] 阅读全文
posted @ 2017-09-15 19:06 XYZinc 阅读(171) 评论(0) 推荐(0)
摘要:题目 "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 阅读全文
posted @ 2017-09-14 16:43 XYZinc 阅读(244) 评论(0) 推荐(0)
摘要:题目 "vijos1642" 普通dp 按照 "黄学长" 的说法,直接dp会超时,下附上我的80分代码 include include include include include define N 1005 using namespace std; int n,m,a[N],f[N][N]; s 阅读全文
posted @ 2017-09-13 20:06 XYZinc 阅读(223) 评论(0) 推荐(0)
摘要:题目 "codevs1427" 数据太水,只有一个测试点,可以在 "RQNOJ204" 上交 题解 双线dp 显然,从i点到j点的最小差值和为abs(a[i] a[j]),存于dis[i][j]中 因为同一条路从左到右和从右到左所得的差值之和是相同的,不妨将所有路都看做从左到右走的,那么题意转化为求 阅读全文
posted @ 2017-09-13 16:16 XYZinc 阅读(133) 评论(0) 推荐(0)
摘要:简单版 "luogu3808" ps.第一次写,不太美观,加强版的好看些 代码 include include include include include include include define N 1000005 using namespace std; int n,ans; int t 阅读全文
posted @ 2017-09-01 15:05 XYZinc 阅读(135) 评论(0) 推荐(0)