2001年成立的TopCoder实际上已经是非常出名了，它的客户包括Google、MS、YAHOO、Intel、
Motorola和SUN等世界上顶级的IT公司，到TopCoder上不仅能给你带来现金的奖励，它还有可能帮助你进入世界顶级的IT企业。要知道
Google为了等待Jon McAlister (jonmac)足足用了两年多的时间，其间还有MS和GlodMan的挖角，最终Jon
McAlister选择了Google。可笑的是中国的IT媒体在翻译时竟然称Google让Jon
McAlister等了一段时间，整个把事情搞反了，这也难怪毕竟这些搞媒体的不了解TopCoder的意义。现在jonmac的等级分是2354，排名50，而WishingBone(中国)的等级分是2533，排名29，我们
大家是不是该为现在的年轻一代感到骄傲呢！知道了这些朋友们是不是想参加TopCoder的比赛呢？下面介绍一下参加步骤：-----------------------------------------------------------------------
Problem Statement
We want to display a two-color pattern on a rectangular array of
pixels, with k of the pixels in the foreground color. We want to choose
the pattern so that it minimizes the boundary between the foreground
and the background.
The length of the boundary is the number of vertical and horizontal
pixel edges that separate a foreground pixel from a background pixel.
For example, this picture shows a rectangular array with three rows and
six columns that has 5 foreground pixels (indicated by 'X'). The
boundary in this case has length equal to 6: the upper left X is
adjacent to 1 background pixel, the upper middle X is adjacent to 1,
the rightmost X is adjacent to 3, the lower left X is adjacent to 0,
and the lower right X is adjacent to 1.
- - - - - -
X X X - - -
X X - - - -
Create a class Coherence that contains the method minBndry that takes
three int inputs, numRows (the height of the array), numCols (the width
of the array), and k (the number of foreground pixels), and returns the
length of the minimum possible boundary.
Definition
Class:
Coherence
Method:
minBndry
Parameters:
int, int, int
Returns:
int
Method signature:
int minBndry(int numRows, int numCols, int k)
(be sure your method is public)
Constraints
-
numRows is between 1 and 30 inclusive
-
numCols is between 1 and 30 inclusive
-
k is between 0 and numRows*numCols inclusive
Examples
0)
6
6
5
Returns: 5
X X X - - -
X X - - - -
- - - - - -
- - - - - -
- - - - - -
- - - - - -
The upper right foreground pixel has 2 boundary edges, the bottom right
one has 2 boundary edges, and the bottom left one has 1 boundary edge.
1)
4
6
16
Returns: 4
X X X X - -
X X X X - -
X X X X - -
X X X X - -
2)
9
5
0
Returns: 0
---------------------------------------------------------------------
|