随笔档案「2012年11月12日」：hdu 3466 ... - CharlotteY

hdu 3466

摘要： Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1365Accepted Submission(s): 562Problem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a resul 阅读全文

posted @ 2012-11-12 22:11 CharlotteY 阅读(166) 评论(0) 推荐(0)

关于sort和qsort

摘要：做题中常会用到排序，之前一直都在用最笨的冒泡法，一遍一遍的写下了连自己都受不了自己了，所以打算开始学一下新的排序方法，就从sort和qsort学起吧（话说这两个最简单了）。sort包含在c++的<algorithm>头文件中，个人认为用法要比qsort简单。先说sort的用法:头文件：#include <algorithm>using namespace std;1.默认的sort函数是按升序排。sort(a,a+n); //两个参数分别为待排序数组的首地址和尾地址2.可以自己写一个cmp函数，按特定意图进行排序。例如：int cmp( const int &a 阅读全文

posted @ 2012-11-12 11:09 CharlotteY 阅读(231) 评论(0) 推荐(0)

hdu 1789

摘要： Doing Homework againTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3190Accepted Submission(s): 1855Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline 阅读全文

posted @ 2012-11-12 10:47 CharlotteY 阅读(157) 评论(0) 推荐(0)

2012年11月12日

公告