算法合集之《淺談類比思想》(文件)
【正文】 nt that he use no trail more than once. (Note well: The goalis to minimize the length of the longest trail, not the sum of thetrail lengths.)It is guaranteed that FJ can make all T trips without reusing a trail.PROBLEM NAME: secretINPUT FORMAT:* Line 1: Three spaceseparated integers: N, P, and T* Lines 2..P+1: Line i+1 contains three spaceseparated integers, A_i, B_i, and L_i, indicating that a trail connects landmark A_i to landmark B_i with length L_i.SAMPLE INPUT (file ):7 9 21 2 22 3 53 7 51 4 14 3 14 5 75 7 11 6 36 7 3OUTPUT FORMAT:* Line 1: A single integer that is the minimum possible length of the longest segment of Farmer John39。= x, y Source file: (xxx=pas,c,cpp)Memory limit: 32 MBAlternative formats: PostScript | PDFA set of integer points on a plane (points whose both cartesian coordinates are integers) which we shall refer to as the pattern, as well as a group of other sets of integer points on the plane are given. We would like to know which of the sets are similar to the pattern, . which of them can be transformed by rotations, translations, reflections and dilations so that they are identical to the pattern. For instance: the set of points {(0,0), (2,0), (2,1)} is similar to the set {(6,1), (6,5), (4,5)}, it is however not similar to the set {(4,0),(6,0), (5,1)}. TaskWrite a programme which:reads from the standard input the description of the pattern and the familly of the investigated sets of points, determines which of the investigated sets of points are similar to the pattern, writes the oute to the standard output. InputIn the first line of the standard input there is a single integer k (1 = k = ) the number of points the pattern consists of. In the following k lines there are pairs of integers, separated by single spaces. The i+1st line containts the coordinates of ith point belonging to the pattern: x_i i y_i (s elevations in profile, depicted belowwith asterisks indicating the heights: * * * * * * * * * * * * ** * * * * * * * * * * *1 2 3 3 3 2 1 3 2 2 1 2A contiguous range of one or more equal elevations in this arrayis a peak if both the left and right hand sides of the range areeither the boundary of the array or an element that is lower inelevation than the peak. The example above has three peaks.Determine the minimum volume of earth (each unit elevation reductioncounts as one unit of volume) that must be removed so that theresulting landscape has no more than K (1 = K = 25) peaks. Notewell that elevations can be reduced but can never be increased.If the example above is to be reduced to 1 pe
環(huán)評公示相關(guān)推薦
鄂ICP備17016276號-1