Building a Ski Course
플래티넘 III의견: 0
Farmer John is helping to turn his large field into a ski course for the upcoming winter Moolympics. The field has dimensions M x N (1 <= M,N <= 100), and its intended final composition is described by an M x N grid of characters, each 'R' for 'rough' or 'S' for 'smooth'.
To build the desired course, Farmer John plans to modify his tractor so that it can stamp any B x B patch of the field (B <= M, B <= N) with either entirely smooth snow or entirely rough snow. Since it takes a long time to reset the tractor between stamps, FJ wants to make B as large as possible. With B = 1 he can clearly create the desired course. However, for larger values of B, it may no longer be possible. Every unit square of the course must at some point be stamped; it cannot be left in its default state.
Please help FJ determine the largest possible value of B he can successfully use.
Line 1: Two space-separated integers M and N.
Lines 2..M+1: M lines of exactly N characters (each R or S), describing the desired ski course design.
The maximum value of B Farmer John can use to create the desired course pattern.
skicourse.inskicourse.out3 6
RSRSSS
RSRSSS
RSRSSS3Output details: FJ can stamp overlapping 3x3 patches (rough cols 1-3, smooth 2-4, rough 3-5, smooth 4-6).
평가 및 의견
Building a Ski Course
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Building a Ski Course