题目链接
分析
手写堆插入
debug了好一会儿,为了不用每次都交换,让 fa 与插入值val比较,记住这时val并没有写到 i <script type="math/tex" id="MathJax-Element-21">i</script>的位置
code
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1010
#define INF 0x3f3f3f3f
int a[MAXN];
int sz =1;
void add(int val){
a[sz++] = val;
int i = sz-1;
while (i>0) {
int fa = (i>>1);
if(a[fa] <= val)break;
else{
a[i] = a[fa];
i = fa;
}
}
// std::cout << i <<" "<< a[i] << '\n';
a[i] = val;
}
int n,m;
int main(int argc, char const *argv[]) {
a[0] = -INF;
cin>>n>>m;
for(int i=0 ; i<n ; ++i){
int tmp;scanf("%d",&tmp );
add(tmp);
}
// for(int i=1 ; i<=n ; ++i)std::cout << a[i] << ' ';
// std::cout << '\n';
while (m--) {
int idx;scanf("%d",&idx );
printf("%d",a[idx] );
while (idx>>=1)printf(" %d",a[idx]);
putchar('\n');
}
return 0;
}