算法入门题 9-1

evilknight

1. 
   
2. 第一题:
   
3. Elevator
   
4. Problem Description
   
5. The highest building in our city has only one elevator. A request list is made
   
6. up with N positive numbers. The numbers denote at which floors the elevator
   
7. will stop, in specified order. It costs 6 seconds to move the elevator up one
   
8. floor, and 4 seconds to move down one floor. The elevator will stay for 5
   
9. seconds at each stop.
   
10. 
    
11. For a given request list, you are to compute the total time spent to fulfill
    
12. the requests on the list. The elevator is on the 0th floor at the beginning
    
13. and does not have to return to the ground floor when the requests are fulfilled.
    
14. 
    
15. 
    
16. Input
    
17. There are multiple test cases. Each case contains a positive integer N, followed
    
18. by N positive numbers. All the numbers in the input are less than 100. A test
    
19. case with N = 0 denotes the end of input. This test case is not to be processed.
    
20. 
    
21. 
    
22. Output
    
23. Print the total time on a single line for each test case.
    
24. 
    
25. 
    
26. Sample Input
    
27. 1 2
    
28. 3 2 3 1
    
29. 0
    
30. 
    
31. 
    
32. Sample Output
    
33. 17
    
34. 41
    
35. 
    
36. 
    
37. 
    
38. 第二题 hdu 1020
    
39. Encoding
    
40. Problem Description
    
41. Given a string containing only 'A' - 'Z', we could encode it using the following method:
    
42. 
    
43. 1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in this sub-string.
    
44. 
    
45. 2. If the length of the sub-string is 1, '1' should be ignored.
    
46. 
    
47. 
    
48. Input
    
49. The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only 'A' - 'Z' and the length is less than 10000.
    
50. 
    
51. 
    
52. Output
    
53. For each test case, output the encoded string in a line.
    
54. 
    
55. 
    
56. Sample Input
    
57. 2
    
58. ABC
    
59. ABBCCC
    
60. 
    
61. 
    
62. Sample Output
    
63. ABC
    
64. A2B3C
    

复制代码