c++
文章平均质量分 87
晴天lov
这个作者很懒,什么都没留下…
展开
-
hdu1173 采矿
采矿 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2589 Accepted Submission(s): 1195 Special Judge Problem Description 某天gameboy玩魔兽R原创 2014-07-12 11:37:43 · 708 阅读 · 0 评论 -
hdu1106排序
排序 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 33638 Accepted Submission(s): 9416 Problem Description 输入一行数字,如果我们把这行数字中的‘5’都看成空格原创 2014-07-12 11:40:26 · 532 阅读 · 0 评论 -
poj2643Election
Election Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3846 Accepted: 1824 Description Canada has a multi-party system of government. Each candidate is gen原创 2014-07-12 11:16:36 · 486 阅读 · 0 评论 -
poj2491Scavenger Hunt
Scavenger Hunt Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2621 Accepted: 1432 Description Background Bill has been the greatest boy scout in America a原创 2014-07-12 11:11:34 · 660 阅读 · 0 评论 -
poj2503Babelfish
Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 31167 Accepted: 13438 Description You have just moved from Waterloo to a big city. The people here原创 2014-07-12 11:05:30 · 373 阅读 · 0 评论 -
快排细则
快速排序库函数 qsort 调用细则 关于快排, 其原理及实现网上可以找到很多, 我给出的那些动画视频链接里面也有形象 的演示,可以上网搜到很多,这里主要讲的是怎样调用系统提供的快排库函数: qsort ,它 包含在 头文件里 , 函数一共四个参数 , 在函数头部加上 #include,转载 2014-07-11 20:31:02 · 482 阅读 · 0 评论 -
使用STL的next_permutation函数生成全排列(C++)
下午研究了一下全排列算法,然后发现C++的STL有一个函数可以方便地生成全排列,这就是next_permutation 在C++ Reference中查看了一下next_permutation的函数声明: #include bool next_permutation( iterator start, iterator end ); The next_permutation() funct转载 2014-07-12 10:24:31 · 436 阅读 · 0 评论 -
poj1007DNA Sorting
DNA Sorting Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 81639 Accepted: 32837 Description One measure of ``unsortedness'' in a sequence is the number of原创 2014-07-12 12:01:53 · 447 阅读 · 0 评论 -
hdu1800Flying to the Mars
Flying to the Mars Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10381 Accepted Submission(s): 3349 Problem Description In the原创 2014-07-12 10:59:12 · 372 阅读 · 0 评论 -
全排列问题的STL用法(next_permutation类)
全排列问题的STL用法(next_permutation类) 标准库全排列next_permutation() 在标准库算法中,next_permutation应用在数列操作上比较广泛.这个函数可以计算一组数据的全排列.但是怎么用,原理如何,我做了简单的剖析. 首先查看stl中相关信息. 函数原型: template bool next_permu转载 2014-07-11 22:14:07 · 463 阅读 · 0 评论 -
poj3664Election Time
Election Time Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7224 Accepted: 3920 Description The cows are having their first election after overthrowing原创 2014-07-12 12:46:27 · 451 阅读 · 0 评论 -
hdu1157Who's in the Middle
Who's in the Middle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9026 Accepted Submission(s): 4339 Problem Description FJ is surv原创 2014-07-12 11:52:11 · 427 阅读 · 0 评论 -
hdu1031Design T-Shirt
Design T-Shirt Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5507 Accepted Submission(s): 2569 Problem Description Soon after he d原创 2014-07-12 11:28:39 · 486 阅读 · 0 评论 -
hdu1029Ignatius and the Princess IV
Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 16291 Accepted Submission(s): 6565 Problem Description "O原创 2014-07-12 10:52:37 · 409 阅读 · 0 评论 -
hdu1894String Compare
String Compare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 2920 Accepted Submission(s): 696 Problem Description Maybe there are原创 2014-07-12 10:46:28 · 375 阅读 · 0 评论 -
hdu1004Let the Balloon Rise
Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 71810 Accepted Submission(s): 26743 Problem Description Contest原创 2014-07-12 10:41:33 · 393 阅读 · 0 评论 -
hdu1236排名
排名 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15093 Accepted Submission(s): 5475 Problem Description 今天的上机考试虽然有实时的Ranklist,但上面的原创 2014-07-12 11:52:33 · 371 阅读 · 0 评论 -
C/C++ sort函数的用法
sort函数的用法 做ACM题的时候,排序是一种经常要用到的操作。如果每次都自己写个冒泡之类的O(n^2)排序,不但程序容易超时,而且浪费宝贵的比赛时间,还很有可能写错。STL里面有个sort函数,可以直接对数组排序,复杂度为n*log2(n)。使用这个函数,需要包含头文件。 这个函数可以传两个参数或三个参数。第一个参数是要排序的区间首地址,第二个参数是区间尾地址的下一地址。也就是说,转载 2014-07-12 13:46:07 · 1072 阅读 · 0 评论