- 博客(6)
- 资源 (10)
- 收藏
- 关注
RSS订阅原创 [ACM] HDU 1242 Rescue (优先队列）
Rescue Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is:
2015-01-14 10:37:33
1803
2
原创 [ACM] POJ 3740 Easy Finding (DFS)
Easy Finding Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16482 Accepted: 4476 Description Given a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), co
2015-01-14 10:30:13
1223
原创 [ACM] HDU 4885 TIANKENG’s travel (特殊建图，最短路）
TIANKENG’s travel Problem Description TIANKENG has get a driving license and one day he is so lucky to find a car. Every day he drives the car around the city. After a month TIANKE
2015-01-13 17:51:01
1543
原创 [ACM] HDU 4884 TIANKENG’s rice shop (模拟）
TIANKENG’s rice shop Problem Description TIANKENG managers a pan fried rice shop. There are n kinds of fried rice numbered 1-n. TIANKENG will spend t time for once frying. Because the pan i
2015-01-13 17:29:28
1840
原创 [ACM] HDU 4883 TIANKENG’s restaurant
TIANKENG’s restaurant Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 931 Accepted Submission(s): 412 Problem Description TIAN
2015-01-13 17:13:59
971
原创 [ACM] ZOJ 3844 Easy Task (模拟+哈希）
Easy Task Time Limit: 2 Seconds Memory Limit: 65536 KB You are given n integers. Your task is very easy. You should find the maximum integer a and the minimum integer b among these n inte
2015-01-11 19:21:58
1955
listView异步加载（多线程和AsyncTask)以及缓存的使用
2016-04-13
AsyncTask加载网络图片并模拟进度条更新
2016-04-13
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人