问题求解与程序设计 称重问题.PPT

问题求解与程序设计第三讲 称重问题 李文新 2004.2 – 2004.6 内容提要 作业总结 - 1008 作业总结 - 1013 何林冬令营报告 – 称球问题 自学及讨论 – 征服者 作业 作业总结 - 1008 题意 Haab 19个月 前18个月每月20天 第19个月5天 0-19 月名 0-5 月名 Tzolkin 13个月 天数为20个轮转 1mix 2--- 3--- … 问题 将Haab日期转换成Tzolkin日期 源程序 1008 源程序 作业总结 - 1013 题意 12枚硬币，其中一枚是假币，可能轻也可能重 称三次，每次左右硬币数目相等，结果：轻重平 问题 求出假币，并给出其轻重 源程序 1013源程序 问题的提出 给定N个球 有个比标准球重的次品混入其中 你有一架天平，用最少的次数找出这个次品。 N = 3 N = 9 更一般的情况 更一般的情况 更一般的情况 n = 3k+1, n = 3k+2和n=3k类似，也是均分成三堆 每次称量把范围大致缩小到原来的1/3 因此：从n个球中找次品至多要称[log3n]次。（[]统一表示取上整） 判定树 判定树 叶子代表结果 非叶子代表一次称量 每个非叶子节点都有三个孩子，表示天平左偏、右偏、平衡 判定树 判定树 N个叶子的三叉树的深度h = [log3n] 小结 引进了有力工具：判定树。将主观的直觉严谨化。 三分法是解决这类问题的根本着眼点。 三分时必须充分的均匀 Problem Conqueror’s batalion Table of Contents The problem Solution The problem CENTRAL EUROPEAN OLYMPIAD IN INFORMATICS 30 June – 6 July 2002 Day 1: conquer Conqueror’s battalion Time limit: 1 s Memory limit: 16 MB The problem In the whole history of mankind one can find several curious battles, like the following one in France, in 1747. . . The problem There was a fortress in Bassignac-le- Haut, a small village lying on the left bank of river Dordogne, just over the Chastang dam. From the dam up to the fortress there was a wide staircase made out of red marble. The problem One day in the morning, the guard spotted a large battalion Approaching the fortress, with a dreaded leader – The Conqueror. The problem When The Conqueror reached the fortress, he was already awaited by its commandant. The commandant proposed: “I see that you have many soldiers behind you, standing on the stairs. We can play a small ‘game’: The problem In each round, you will divide your soldiers into two groups in an arbitrary way. Then I will decide which one of them stays and which one goes home. Each soldier that stays will then move up one stair. The problem If at least one of your soldiers reaches the uppermost stair, you will be the winner, in the other case, you will be the loser. The problem The Conqueror immediately liked this ga