杭电ACM课件(lecture_02)简单数学题.ppt

ACM程序设计 第二讲 老少皆宜之数学题 ACM数学题特点分析: 题意容易理解 算法相对简单（有些很难的！！） 编程比较容易 ACM/ICPC入门练习的好选择 下面，分类介绍： 从首届“舜宇”杯说起 比赛背景 由于前一年的邀请赛很多学校没有做出一道题，所以，这次的比赛特意准备了几道简单的题目，目的就是让大多数的学校都能拿个气球回去，也好有个交待，于是有… 第一类 1004: Let the Balloon Rise Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.This year, they decide to leave this lovely job to you. Input Input contains multiple test cases. Each test case starts with a number N (0 N = 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.A test case with N = 0 terminates the input and this test case is not to be processed. ? Output For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case. Sample Input 5 green red blue red red 3 pink orange pink 0 ? 题目评述： 1. 一个让你看到后兴奋的题目… 1004题目分析： 该题算法思想比较简单，就是对输入的字符串进行比较和统计。值得注意的一点是： 如果用C语言来写，要注意可能会把第一个数字后的“回车符”误认为是第一个串。 思路分析 设置两个数组: 一个数组color[],每个元素存储一个不同颜色 一个数组count[],每个元素count[i]存储颜色color[i]的出现次数 思路分析 （1）对i从1到n做 读入一个颜色str 在color数组中查找，若找不到，在表尾添加一个颜色，个数为1;若找到，对应颜色数加1 （2）遍历count数组，找到最大值count[i],则对应color[i]即所求颜色 1008: Elevator Problem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor whe