栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 1757 Binary Search

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 1757 Binary Search

#include <stdio.h>#include <limits.h>#include <string.h>#define N 10001int sequence[N],line,time,result,answer[N / 2 + 2][2];int find(){    memset(sequence,0,sizeof(sequence));int k,time1,p,q,i,aim,kmax = 0;for (k = 1;k <= 10000;k ++){aim = line;time1 = time;p = 0;q = k - 1;while (time1 > 0){time1 --;i = (p + q) / 2;if (i == aim && time1 > 0)break;if (i == aim && time1 == 0){sequence[k] = 1;kmax = k;break;}if (line < i)q = i - 1;elsep = i + 1;}}result = 0;memset(answer,0,sizeof(answer));i = 1;while(i <= kmax){if (sequence[i] == 1){result ++;answer[result][0] = i;while (sequence[i] == 1)i ++;answer[result][1] = i - 1;}elsei ++;}printf("%dn",result);for (i = 1;i <= result;i ++)printf("%d %dn",answer[i][0],answer[i][1]);return 0;}int main(){scanf("%d%d",&line,&time);find();return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/377976.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号