Above the Median
플래티넘 IV의견: 0
Farmer John has lined up his N (1 <= N <= 100,000) cows in a row to measure their heights; cow i has height H_i (1 <= H_i <= 1,000,000,000) nanometers--FJ believes in precise measurements! He wants to take a picture of some contiguous subsequence of the cows to submit to a bovine photography contest at the county fair.
The fair has a very strange rule about all submitted photos: a photograph is only valid to submit if it depicts a group of cows whose median height is at least a certain threshold X (1 <= X <= 1,000,000,000).
For purposes of this problem, we define the median of an array A[0...K] to be A[ceiling(K/2)] after A is sorted, where ceiling(K/2) gives K/2 rounded up to the nearest integer (or K/2 itself, it K/2 is an integer to begin with). For example the median of {7, 3, 2, 6} is 6, and the median of {5, 4, 8} is 5.
Please help FJ count the number of different contiguous subsequences of his cows that he could potentially submit to the photography contest.
Line 1: Two space-separated integers: N and X.
Lines 2..N+1: Line i+1 contains the single integer H_i.
The number of subsequences of FJ's cows that have median at least X. Note this may not fit into a 32-bit integer.
median.inmedian.out4 6
10
5
6
27Input details: FJ's four cows have heights 10, 5, 6, 2. We want to know how many contiguous subsequences have median at least 6.
Output details: There are 10 possible contiguous subsequences to consider. Of these, only 7 have median at least 6. They are {10}, {6}, {10, 5}, {5, 6}, {6, 2}, {10, 5, 6}, {10, 5, 6, 2}.
riseoj 작성
출처 올림피아드 > USACO > 2011-2012 > November > Gold
평가 및 의견
Above the Median
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Above the Median