剑指Offers 题目1384：二维数组中的查找

#include <stdio.h>
#include <stdlib.h>
int a[1010][1010];
int main()
{
          int m, n, t;
           int flag;
 while(scanf("%d%d", &m, &n) !=EOF){
 
             scanf("%d", &t);
   for(int i=0; i<m; i++)
              for(int j=0; j<n; j++)
                     scanf("%d", &a[i][j]);
 
           for(int i=0; i<m; i++){
                      flag = 1;
          //if(!binary_Search(a[i], 0, n-1, t))
         // {
         ///            flag = 0;
        //             break;
        //  }
               int left=0, right=n-1;
              while(left <= right){
                     int mid = (left+right)>>1;
                     if(a[i][mid] > t){
                             right = mid - 1;
                    }else if(a[i][mid] < t){
                            left = mid + 1;
                    }else{
                              flag=0;
                              break;
                            }
                  }
           if(!flag)
                    break;
 
}
            if(!flag)
                    printf("Yes\n");
            else
                    printf("No\n");
 
 }
       return 0;
 
 
}
 
/**************************************************************
    Problem: 1384
    User: qiu0130
    Language: C
    Result: Accepted
    Time:680 ms
    Memory:4900 kb
****************************************************************/