这题我第一次sub的时候用冒泡排序+顺序查找 结果给出来的结果
我瞬间崩溃了,.。。这种题一定得用快排和折半查找才行,加油!
Problem | Verdict | Lang | Time | Best | Rank | Submit Time |
---|---|---|---|---|---|---|
discuss10474 - | Accepted | C++ | 1.899 | 0.024 | 2817 | 4 mins ago |
我瞬间崩溃了,.。。这种题一定得用快排和折半查找才行,加油!
冒泡+顺序查找代码
#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;
}