uva 10474 - Where is the Marble?

点击打开链接

代码:

//只要对输入的数据排序,然后查找即可(可用二分,更快)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <list>
#include <vector>
#include <stack>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXN = 10010;

int n , q;
int arrN[MAXN];
int arrQ[MAXN];
int numQ[MAXN];

int main(){
    int cnt = 1;
    while(scanf("%d%d%*c" , &n , &q) &&q &&n){
       for(int i = 0 ; i < n ; i++)
           scanf("%d" , &arrN[i]);
       sort(arrN , arrN+n);
       memset(arrQ , 0 ,sizeof(arrQ));
       for(int i = 0 ; i < q ; i++){
           scanf("%d" , &numQ[i]);
           for(int j = 0 ; j < n ;j++){
               if(numQ[i] == arrN[j]){
                   arrQ[numQ[i]] = j+1;
                   break;
               }
           }
       }
       printf("CASE# %d:\n" , cnt);
       for(int i = 0 ; i < q ; i++){
           if(arrQ[numQ[i]]){
               printf("%d found at %d\n" , numQ[i] , arrQ[numQ[i]]);
           }
           else
               printf("%d not found\n" , numQ[i]);
       }
       ++cnt;
    }
    return 0;
}
时间: 2012-07-15

uva 10474 - Where is the Marble?的相关文章

UVa 10474 Where is the Marble? (二分查找&amp;amp;equal_range()的使用

10474 - Where is the Marble? Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=1415 Raju and Meena love to play with Marbles. They have got a lot of marble

UVa 10602

链接: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1543 类型:贪心 原题: Company Macrohard has released it's new version of editor Nottoobad, which can understand a few voice commands.

UVa 10392 Factoring Large Numbers:素因子分解

10392 - Factoring Large Numbers Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=100&page=show_problem&problem=1333 One of the central ideas behind much cryptography is that factoring

UVa 10182 Bee Maja:规律&amp;amp;O(1)算法

10182 - Bee Maja Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1123 Maja is a bee. She lives in a bee hive with thousands of other bees. This bee hive c

算法题之UVA 763

Fibinary Numbers The standard interpretation of the binary number 1010 is 8 + 2 = 10. An alternate way to view the sequence ``1010'' is to use Fibonacci numbers as bases instead of powers of two. For this problem, the terms of the Fibonacci sequence

算法题:UVa 11461 Square Numbers (简单数学)

11461 - Square Numbers Time limit: 1.000 seconds http://uva.onlinejudge.org/index.php? option=com_onlinejudge&Itemid=8&category=467&page=show_problem&problem=24 56 A square number is an integer number whose square root is also an integer.

UVa 10183 How Many Fibs? (统计斐波那契数个数&amp;amp;高精度)

10183 - How Many Fibs? Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=1124 Recall the definition of the Fibonacci numbers:    f1 := 1    f2 := 2    fn :

UVa 701 The Archeologists&#039; Dilemma: 数学及枚举

701 - The Archeologists' Dilemma Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=642 An archeologist seeking proof of the presence of extraterrestrials i

UVa 550 Multiplying by Rotation:模拟乘法

550 - Multiplying by Rotation Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=100&page=show_problem&problem=491 Warning: Not all numbers in this problem are decimal numbers! Multiplic