原创 多重揹包的取模優化
取模優化 當輸入樣本特別大時,比如給出上百萬件物品,這時候僅靠優化算法仍然不能使運行時間降到滿意的範圍。可考慮如何減少輸入樣本。poj1014的discussion上有一個非常巧妙的“取模優化”法。 設價值爲v(1<=v<=6)的物
原创 Coins(多重揹包+二進制優化)
Coins Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9658
原创 Watch The Movie(嚴格限制數量的二維費用揹包)
Watch The Movie Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s
原创 Dividing(多重揹包+二進制優化)
Dividing Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 63688 Accepted: 16498 Description Marsha an
原创 Subsequence
Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5
原创 二叉樹層次遍歷,深度計算(遞歸+非遞歸)
import java.util.LinkedList; import java.util.List; public class BinaryTreeDeep { public static void main(String[
原创 Immediate Decodability(C++ Stl -----substr判斷前綴)
Immediate Decodability Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submi
原创 安卓四種線程池
package cn.edu.jlnu.threaddemo; import android.support.v7.app.AppCompatActivity; import android.os.Bundle; import andr
原创 Orders(C++ stl next_permutation)
Orders Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9928 Accepted: 6040 Description The stores ma
原创 Problem C: P1053
Problem C: P1053 Time Limit: 0 Sec Memory Limit: 128 MBSubmit: 13 Solved: 1 [Submit][Status][Web Board] Descripti
原创 handler用法
package cn.edu.jlnu.asymessage; import android.os.Handler; import android.os.Message; import android.support.v7.