https://blog.youkuaiyun.com/OMRailgunzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/OMRailgun/article/details/54565179https://blog.youkuaiyun.com/OMRailgun/article/details/54565179OMRailgunSun, 15 Jan 2017 22:25:21 +0800 #include #include #inc]]>https://blog.youkuaiyun.com/OMRailgun/article/details/54564963https://blog.youkuaiyun.com/OMRailgun/article/details/54564963OMRailgunSun, 15 Jan 2017 21:49:19 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/54430085https://blog.youkuaiyun.com/OMRailgun/article/details/54430085OMRailgunSat, 14 Jan 2017 23:25:27 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/54428740https://blog.youkuaiyun.com/OMRailgun/article/details/54428740OMRailgunSat, 14 Jan 2017 20:52:05 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/54139677https://blog.youkuaiyun.com/OMRailgun/article/details/54139677OMRailgunFri, 06 Jan 2017 16:44:12 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/54092306https://blog.youkuaiyun.com/OMRailgun/article/details/54092306OMRailgunThu, 05 Jan 2017 13:47:06 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/54029858https://blog.youkuaiyun.com/OMRailgun/article/details/54029858OMRailgunThu, 05 Jan 2017 00:13:17 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/53997817https://blog.youkuaiyun.com/OMRailgun/article/details/53997817OMRailgunTue, 03 Jan 2017 20:59:43 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/53941709https://blog.youkuaiyun.com/OMRailgun/article/details/53941709OMRailgunFri, 30 Dec 2016 13:23:18 +08001e5,所以1e5以内的数字至多有6个质因子,且若x是y的倍数,y=a1^b1*a2^b2...*ak^bk,其中ai为素数,x=a1^c1*a2^c2..]]>https://blog.youkuaiyun.com/OMRailgun/article/details/53939965https://blog.youkuaiyun.com/OMRailgun/article/details/53939965OMRailgunFri, 30 Dec 2016 10:21:22 +0800https://blog.youkuaiyun.com/OMRailgun/article/details/53932953https://blog.youkuaiyun.com/OMRailgun/article/details/53932953OMRailgunThu, 29 Dec 2016 23:10:49 +0800=K的子矩阵,使得这个子矩阵中最小的数字最大. 解题思路主要是二分答案,即二分那个最小的数字,然后针对每次二分的值mid,可以将原矩阵根据是否满足A[i][j]>=mid,而转成一个R*C的01矩阵a[][],然后问题求变成了给定一个二维01矩阵,求最大的满1矩阵,可以用单调栈的思想来处理这个子问题,设b[i][j]表示从a[i][j]]]>https://blog.youkuaiyun.com/OMRailgun/article/details/53931521https://blog.youkuaiyun.com/OMRailgun/article/details/53931521OMRailgunThu, 29 Dec 2016 19:43:10 +0800