- 博客(11)
- 资源 (14)
- 收藏
- 关注
原创 最大上升子序列的和
上升子序列 Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 一个只包含非负整数的序列bi,当b1 2 S的时候,我们称这个序列是上升的。对于给定的一个序列{a1, a2, ...,aN},我们可以得到一些上升的子序列{ai1, ai2, ..., aiK},这里1 ≤ i1 2 K ≤ N。例如:对
2013-06-23 00:14:33 1224
原创 UVA 10881 Piotr's Ants
点击打开链接 Problem D Piotr's Ants Time Limit: 2 seconds "One thing is for certain: there is no stopping them; the ants will soon be here. And I, for one, welcome our new insect overlord
2013-06-22 21:11:29 1204
原创 UVA 11729 Commando War
点击打开链接 G Commando War Input: Standard Input Output: Standard Output “Waiting for orders we held in the wood, word from the front never came By evening the
2013-06-22 19:32:10 955
原创 UVA 11292 Dragon of Loowater
Problem C: The Dragon of Loowater Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. The shores of Rellau Creek in central Loowater had always been a prime
2013-06-22 19:09:18 1017
转载 向量的旋转
向量的旋转 实际做题中我们可能会遇到很多有关及计算几何的问题,其中有一类问题就是向量的旋转问题,下面我们来具体探讨一下有关旋转的问题。 首先我们先把问题简化一下,我们先研究一个点绕另一个点旋转一定角度的问题。已知A点坐标(x1,y1),B点坐标(x2,y2),我们需要求得A点绕着B点旋转θ度后的位置。 A点绕B点旋转θ角度后得到的点,问题是我们要如何才能得到A' 点的坐标。(
2013-06-20 19:26:59 1340
原创 2013年山东省第四届ACM大学生程序设计竞赛
Rescue The Princess Time Limit: 1000MS Memory limit: 65536K 题目描述 Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a p
2013-06-20 19:25:27 2628
原创 ZOJ 1586 QS Network 最小生成树水题
点击打开链接 QS Network Time Limit: 2 Seconds Memory Limit: 65536 KB Sunny Cup 2003 - Preliminary Round April 20t
2013-06-07 18:58:01 1755
原创 ZOJ 1904 Frogger 另一种Dijkstra
点击打开链接 Frogger Time Limit: 2 Seconds Memory Limit: 65536 KB Freddy Frog is sitting on a stone in the m
2013-06-05 20:29:26 1169
原创 ZOJ 1655 Transport Goods 最短路变形
点击打开链接 Transport Goods Time Limit: 2 Seconds Memory Limit: 65536 KB The HERO country is attacked by other count
2013-06-05 18:25:15 1186
原创 A Big Dinner 枚举
点击打开链接 Description As is known to all, an ACM team consists of three members and to know more about each others, they often go to a restaurant to have a big dinner. Each member ordered
2013-06-05 16:23:27 1091
原创 ZOJ 3258 Wistone and Owenwater 01背包+完全背包
点击打开链接 Wistone and Owenwater Time Limit: 1 Second Memory Limit: 32768 KB DD and his girlfriend love travelling,
2013-06-03 21:03:31 1306
计算复杂性导论(堵丁柱)
2018-09-17
CUDA Programming A Developer's Guide to Parallel Computing with GPUs
2018-08-29
CUDA编程指南5.0
2018-08-29
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人