Vmorish

—— Anything is possible

排序:
默认
按更新时间
按访问量
RSS订阅

HDU-6052 card card card(尺取法)

HDU-6052 card card card(尺取法) Problem Description As a fan of Doudizhu, WYJ likes collecting playing cards very much. One day, MJF takes a stack of c...

2017-09-11 21:43:17

阅读数:126

评论数:0

ZOJ - 3574 Under Attack II(计算几何 归并排序)

ZOJ - 3574 Under Attack II(计算几何 归并排序) Because of the sucessfully calculation in Under Attack I, Doctor is awarded with Courage Cross and promoted to ...

2017-08-07 09:25:32

阅读数:129

评论数:0

HDU - 4911 Inversion(归并排序求逆序数)

HDU - 4911 Inversion(归并排序求逆序数) Problem Description bobo has a sequence a1,a2,…,an. He is allowed to swap two adjacent numbers for no more than k tim...

2017-08-06 23:35:16

阅读数:129

评论数:0

POJ - 1804 Brainman(归并排序求逆序数)

POJ - 1804 Brainman(归并排序求逆序数) Description Background Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spille...

2017-08-06 20:39:39

阅读数:126

评论数:0

UVA-514Rails(栈)

题目来源:https://vjudge.net/problem/UVA-514 题意:某城市有一个火车站,有n节车厢从A方向驶入车站,按进站顺序编号为1~n。判断是否能让他们按照某种特定的顺序进入B方向并驶出车站。(只有A->C、C->B两种行驶选择)。 分析:在中转站C中,符...

2017-03-11 11:07:44

阅读数:187

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭