摘要：#include<stdio.h>#include<string.h>#include<stdlib.h>int n,set[110],a;int erfen_search(){ int low,mid,high; high=n; low=1; int flag=0; while(low<=high) { mid=(low+high)/2; if(set[a]>set[mid]) { low=mid+1; } else if(set[a]<set[mid]) { high=mid-1; } else { flag=mid; break; } 阅读全文

摘要：#include<stdio.h>#include<string.h>#include<stdlib.h>int n,set[110],a;int s_search(){ set[0]=a; int i=n; while(set[i]!=set[0]) { i--; } return i;}int main(){ while(scanf("%d%d",&n,&a),n) { memset(set,0,sizeof(set)); for(int i=1;i<=n;i++) { scanf("%d", 阅读全文