StarInShadow的博客

15Puzzle 强行A*求解 C++

StarInShadow — Tue, 29 Oct 2019 21:39:05 +0800

U=depth*factor1+getU(f,p)*factor2; 通过调整factor1和factor2可以在求最优解与程序开销之间平衡，对于一般的最坏情况与此解法的hack情况两种极端有： factor1:factor2 = 9:5 就能求出 15 14 13 12 11 10 9 8 7 6 5 4 3 1 2 0 的最短解（70），在 luogu上花费10s/340MB，在我6k的轻...

Leetcode 611. Valid Triangle Number O(nlogn) NTT

StarInShadow — Thu, 24 Oct 2019 14:54:10 +0800

vector rev=[]() { vector Rev(2048,0); for(int i=0; i<2048; i++) Rev[i]=(Rev[i>>1]>>1)|((i&1)<<(10)); return Rev; }(); class Solution { publ...

leetcode 1231.Divide Chocolate (数组分段和最小值的最大值）

StarInShadow — Sat, 19 Oct 2019 23:54:27 +0800

比较简单，就不翻译了 1231. Divide Chocolate You 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...