URAL 1416. Confidential
1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1416 1416. Confidential Time limit: 2.0 second Memory limit: 64 MB Zaphod Beeblebrox — President of the Imperial Galactic Government. And by chan…
Read more
learn, build, evaluate
1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1416 1416. Confidential Time limit: 2.0 second Memory limit: 64 MB Zaphod Beeblebrox — President of the Imperial Galactic Government. And by chan…
Read more
1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1434 1434. Buses in Vasyuki Time limit: 3.0 second Memory limit: 64 MB The Vasyuki University is holding an ACM contest. In order to help the par…
Read more
1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1980 1980. Road to Investor Time limit: 1.0 second Memory limit: 64 MB ‘How could I forget it? In T hours we must show the alpha-version of our g…
Read more
1. 题目 http://acm.timus.ru/problem.aspx?space=1&num=1753 1753. Bookshelf Time limit: 0.5 second Memory limit: 64 MB A bookshelf has length L and borders of height h. A book of height H is standing …
Read more
1. 题目 http://poj.org/problem?id=3273 Monthly Expense Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18048 Accepted: 7226 Description Farmer John is an astounding accounting wizard and has …
Read more
1. 题目 http://poj.org/problem?id=2456 Aggressive cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8456 Accepted: 4224 Description Farmer John has built a new long barn, with N (2 <= N…
Read more
1. 题目 http://poj.org/problem?id=1064 Cable master Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 30585 Accepted: 6482 Description Inhabitants of the Wonderland have decided to hold a regio…
Read more
1. 题目 http://poj.org/problem?id=3259 Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 36967 Accepted: 13562 Description While exploring his many farms, Farmer John has discovered a…
Read more
归并排序应用分治算法,具有O(nlogn)的时间复杂度,其工作流程可以概述为: 将长度为n的无序序列分割成n个子序列,每个序列包含1个元素; 重复将子序列相互合并称为有序序列,直到只剩下1个序列,即为排序后的序列。 一个例程如下所示: void merge(int array[], int tmpArray[], int lPos, int rPos, int rEnd) { int i,…
Read more