uvaoj10474
来源:互联网 发布:at89c52中文数据手册 编辑:程序博客网 时间:2024/05/20 12:22
这题我第一次sub的时候用冒泡排序+顺序查找 结果给出来的结果
我瞬间崩溃了,.。。这种题一定得用快排和折半查找才行,加油!
Problem Verdict Lang Time Best Rank Submit Time
我瞬间崩溃了,.。。这种题一定得用快排和折半查找才行,加油!
冒泡+顺序查找代码
#include<iostream>using std::cin;using std::cout;int marbleNumbers[10010],marbleQueries[10010];int main(){ int N,Q; int i,j,t,_CASE = 0,find; cin >> N,cin >> Q; while(N != 0 && Q != 0) { _CASE++; for(i = 0; i < N; i++) { cin >> marbleNumbers[i]; } for(i = 0; i < Q; i++) { cin >> marbleQueries[i]; } for(i = 0; i <= N-2; i++) for(j = i+1; j <= N-1; j++) if(marbleNumbers[i] > marbleNumbers[j]) { t = marbleNumbers[i]; marbleNumbers[i] = marbleNumbers[j]; marbleNumbers[j] = t; } cout << "CASE# " << _CASE << ":\n"; for(j = 0; j < Q; j++) { find = 0; for( i = 0; i < N; i++) if(marbleQueries[j] == marbleNumbers[i]) { find = 1; cout << marbleQueries[j] << " found at "<< (i+1) << "\n"; break; } if(find == 0) cout << marbleQueries[j] << " not found\n"; } cin >> N,cin >> Q; } return 0;}
- uvaoj10474
- 再探uvaoj10474
- UVaOJ10474---Where is the Marble?
- uvaoj10474---详解细节(二分法)注意!
- Flex Tree 如何在不选定节点的情况下进行添加(Demo)
- Resource is out of sync with the file system错误解决
- 找新朋友
- cJson 创建 读取
- UVA10054 The Necklace
- uvaoj10474
- Fibonacci
- 最短路
- 关于css设置层透明
- Issue 14523: layout_span and layout_column is missing
- visio 2010 给线加箭头
- A strange lift
- 畅通工程续
- c++继承经典例子