2014年6月10日
Uva10474 - Where is the Marble?
摘要： 两种解法： 1.计数排序 //计数排序#include#include#include#includeusing namespace std;const int maxn=10001;int v[maxn], s[maxn];int main() { int N, Q; int Kase=0; while(cin>>N>>Q && N && Q) { ... 阅读全文
posted @ 2014-06-10 16:46 katago 阅读(157) 评论(0) 推荐(0)
Uva110 Meta-Loopless Sorts
摘要： Meta-Loopless Sorts Background Sorting holds an important place in computer science. Analyzing and implementing various sorting algorithms forms an important part of the education of most comput... 阅读全文
posted @ 2014-06-10 15:22 katago 阅读(289) 评论(0) 推荐(0)