- 博客(6)
- 收藏
- 关注
RSS订阅原创 UVA 10514 【computing geometry】
Thinking: This problem is the combination of computing geometry and dijkstra algorithm. We consider bank1 and bank2 as two point. Consider each island as a point.There are some things that attent
2016-05-31 23:19:53
492
原创 UVA 10779 【maximum flow】
Thought :We consider Bob as source , then according to what bob has, we add_edge between Bob and stickers with weight number[sticker]. When it comes to his friends, since they will keep at least
2016-05-31 23:07:18
436
原创 UVA 10739 [classical dp]
Method : We use dp[i][j] (i If str[i] == str[j] , dp[i][j] = dp[i+1][j-1]. Or if str[i]!= str[j], dp[i][j] = min (dp[i+1][j],dp[i][j-1],dp[i+1][j-1]) + 1;dp[i+1][j] ----> delete operation,dp[i
2016-05-30 13:04:36
333
原创 UVA 10301
Well , this question is quite simple actually. Just use r1+r2 <d and fabs(r1-r2) < d to judge whether the two circle intersect with each other. Combine geometry and disjoint set together to get the so
2016-05-27 22:10:24
402
原创 UVA 10230
reference link:http://tmt514-blog.logdown.com/posts/549466-divide-and-conquer-method-v-l-shaped-brick-problemMethod: Here we used the divide and conquer method. Use recursion to deal with sub-block(
2016-05-27 14:11:44
470
原创 UVA 10140
meaning of the problem:Given two int L and U, find 2 pair of prime number. The first pair should be adjacent prime number the difference between whom is the smallest and that of the other pair sho
2016-05-27 14:07:44
373
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人