- 博客(3)
- 收藏
- 关注
原创 15Puzzle 强行A*求解 C++
U=depth*factor1+getU(f,p)*factor2;通过调整factor1和factor2可以在求最优解与程序开销之间平衡,对于一般的最坏情况与此解法的hack情况两种极端有:factor1:factor2 = 9:5 就能求出15 14 13 1211 10 9 87 6 5 43 1 2 0的最短解(70),在 luogu上花费10s/340MB,在我6k的轻...
2019-10-29 21:39:05 1051
原创 Leetcode 611. Valid Triangle Number O(nlogn) NTT
vector<unsigned> rev=[]() { vector<unsigned> Rev(2048,0); for(int i=0; i<2048; i++) Rev[i]=(Rev[i>>1]>>1)|((i&1)<<(10)); return Rev;}();class Solution {publ...
2019-10-24 14:54:10 217
原创 leetcode 1231.Divide Chocolate (数组分段和最小值的最大值)
比较简单,就不翻译了1231. Divide ChocolateYou have one chocolate bar that consists of some chunks. Each chunk has its own sweetness given by the array sweetness.You want to share the chocolate with your K fr...
2019-10-19 23:54:27 905
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人