UVA 10474 - Where is the Marble?
2014-08-12 15:49
369 查看
题目大意:给出 n 个数 和 m 个要查找的数,让你在这 n 个数排完序后的队伍中 找出这个 m 个数第一次出现的位置
解题思路:直接从 n 个数出查找是否存在这个数,并记录所有比他小的数的个数,这个数加一就是它在排完序后在队伍中位置
解题思路:直接从 n 个数出查找是否存在这个数,并记录所有比他小的数的个数,这个数加一就是它在排完序后在队伍中位置
#include <cstdio> int main() { int n, m; int count = 0; while (scanf("%d%d", &n, &m), n) { printf("CASE# %d:\n", ++count); int arr[10010], brr[10010]; for (int i = 0; i < n; i++) scanf("%d", &arr[i]); for (int i = 0; i < m; i++) { scanf("%d", &brr[i]); int num = 0, ok = 0; for (int j = 0; j < n; j++) { if (brr[i] == arr[j]) //判断队伍中是否存在此数 ok = 1; if (brr[i] > arr[j]) //寻找此数在排序完的队伍中第一次出现的位置 num++; } ok ? printf("%d found at %d\n", brr[i], num + 1) : printf("%d not found\n", brr[i]); } } return 0; }
相关文章推荐
- UVa 10474 Where is the Marble? (二分查找&equal_range()的使用)
- UVA 10474 Where is the Marble?
- uva 10474 Where is the Marble? 计数排序
- UVA 10474 - Where is the Marble?
- uva 10474 Where is the Marble?
- UVA 10474 Where is the Marble?
- UVa 10474 - Where is the Marble
- Uva 10474 Where is the Marble?
- uva 10474 Where is the Marble?
- uva-10474 - Where is the Marble?
- UVa10474 Where is the Marble?
- UVA10474 - Where is the Marble?
- UVa 10474 - Where is the Marble?
- UVa - 10474 - Where is the Marble?
- uva 10474 - Where is the Marble?
- UVA 10474 - Where is the Marble?
- UVa 10474 Where is the Marble?
- UVa 10474 - Where is the Marble?
- uva 10474 Where is the Marble? 计数排序
- UVa 10474 - Where is the Marble?