https://blog.youkuaiyun.com/yfzcsczh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/yfzcsc/article/details/82917385https://blog.youkuaiyun.com/yfzcsc/article/details/82917385yfzcscMon, 01 Oct 2018 16:56:22 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/81165138https://blog.youkuaiyun.com/yfzcsc/article/details/81165138yfzcscMon, 23 Jul 2018 11:40:11 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/80890417https://blog.youkuaiyun.com/yfzcsc/article/details/80890417yfzcscMon, 02 Jul 2018 21:51:15 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79681391https://blog.youkuaiyun.com/yfzcsc/article/details/79681391yfzcscSat, 24 Mar 2018 20:41:03 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79490144https://blog.youkuaiyun.com/yfzcsc/article/details/79490144yfzcscThu, 08 Mar 2018 21:15:40 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79489931https://blog.youkuaiyun.com/yfzcsc/article/details/79489931yfzcscThu, 08 Mar 2018 21:00:40 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79380363https://blog.youkuaiyun.com/yfzcsc/article/details/79380363yfzcscMon, 26 Feb 2018 18:12:54 +0800 #define maxn 110 using name]]>https://blog.youkuaiyun.com/yfzcsc/article/details/79294592https://blog.youkuaiyun.com/yfzcsc/article/details/79294592yfzcscFri, 09 Feb 2018 00:02:44 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79166877https://blog.youkuaiyun.com/yfzcsc/article/details/79166877yfzcscThu, 25 Jan 2018 21:27:13 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79144964https://blog.youkuaiyun.com/yfzcsc/article/details/79144964yfzcscTue, 23 Jan 2018 21:34:14 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79144755https://blog.youkuaiyun.com/yfzcsc/article/details/79144755yfzcscTue, 23 Jan 2018 21:17:45 +0800nzhtl1477nzhtl1477nzhtl1477把罚抄打通！ 这题当然是O(nn+nlogn)" role="presentation" style="position: relative;">O(nn−−√+nlogn]]>https://blog.youkuaiyun.com/yfzcsc/article/details/79144416https://blog.youkuaiyun.com/yfzcsc/article/details/79144416yfzcscTue, 23 Jan 2018 20:49:14 +0800 #def]]>https://blog.youkuaiyun.com/yfzcsc/article/details/79144312https://blog.youkuaiyun.com/yfzcsc/article/details/79144312yfzcscTue, 23 Jan 2018 20:39:04 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/79079574https://blog.youkuaiyun.com/yfzcsc/article/details/79079574yfzcscTue, 16 Jan 2018 21:42:19 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/78953772https://blog.youkuaiyun.com/yfzcsc/article/details/78953772yfzcscTue, 02 Jan 2018 17:20:38 +0800https://blog.youkuaiyun.com/yfzcsc/article/details/78947277https://blog.youkuaiyun.com/yfzcsc/article/details/78947277yfzcscMon, 01 Jan 2018 20:47:51 +08001n>1时，考虑倍增 令A(x)Bk(x)=1(modA(x)B_{k}(x)=1(mod xk)x^k) 假设已知B⌈n2⌉B_{\l]]>https://blog.youkuaiyun.com/yfzcsc/article/details/78659535https://blog.youkuaiyun.com/yfzcsc/article/details/78659535yfzcscTue, 28 Nov 2017 21:27:05 +0800 using namespace std; void dfs(int x,string a,string b,string c){ if(x==a.length()){ if(b==c){puts("YES");exit(0);} else return ; } if(a[]]>https://blog.youkuaiyun.com/yfzcsc/article/details/78526537https://blog.youkuaiyun.com/yfzcsc/article/details/78526537yfzcscTue, 14 Nov 2017 08:21:05 +0800b有边,那么val[a] S->i(0),i+n->T(0),i->i+n(-val[i]) a[i]->b[i](inf),a[i]+n->b[i]+n(i]]>https://blog.youkuaiyun.com/yfzcsc/article/details/78472383https://blog.youkuaiyun.com/yfzcsc/article/details/78472383yfzcscTue, 07 Nov 2017 20:57:24 +0800dp[i][j][l](从方向k可以不通过(i,j)到方向l)    dp[i][j][k]->dp[i'][j'][k](人推动箱子) 最后答案就是枚举所有的(i,]]>https://blog.youkuaiyun.com/yfzcsc/article/details/77688072https://blog.youkuaiyun.com/yfzcsc/article/details/77688072yfzcscTue, 29 Aug 2017 21:31:03 +0800