#include<stdio.h>
#define MAXN1000
typedef int tree[MAXN];voidInitialization(tree T, int N);voidSearch(tree T);
int Tag(tree T, int x);
int main(){
int N;
tree T;scanf("%d",&N);Initialization(T,N);Search(T);return0;}voidInitialization(tree T, int N){
int i;for(i =1; i <=N; i++)scanf("%d",&T[i]);}voidSearch(tree T){
int x1, x2;scanf("%d %d",&x1,&x2);if(!T[1])printf("ERROR: T[1] is NULL");elseif(!T[x1])printf("ERROR: T[%d] is NULL", x1);elseif(!T[x2])printf("ERROR: T[%d] is NULL", x2);else{Tag(T, x1);
int ret =Tag(T, x2);printf("%d %d", ret,-T[ret]);}}
int Tag(tree T, int x){
int i;for(i = x;T[i]>0&& i >0; i /=2)T[i]=-T[i];return i;}
01-复杂度3-二分查找-函数题解题代码测试结果问题整理解题代码#include<stdio.h>#define MAXN 1000typedef int tree[MAXN];void Initialization(tree T, int N);void Search(tree T);int Tag(tree T, int x);int main(){ int N...