USACO 2019 January Contest Platinum Problem 1 Redistricting
The cow mega-city Bovinopolis is redistricting! -- always a contentious political process between the two major cow breeds (Holsteins and Guernseys) living there, since both breeds want to make sure they retain sufficient influence in the Bovinopolis government.
The greater metropolitan area of Bovinopolis consists of a line of NN pastures (1≤N≤3⋅1051≤N≤3⋅105), each containing a single cow, which is either a Holstein or a Guernsey.
The government of Bovinopolis wants to divide the greater metropolitan area into some number of contiguous districts, so that each district contains at most KK pastures (1≤K≤N1≤K≤N), and every pasture is contained in exactly one district. Since the government is currently controlled by Holsteins, they want to find a way to redistrict which minimizes the number of Guernsey-majority or tied districts (a district is tied if the number of Guernseys equals the number of Holsteins).
A concerned coalition of Guernseys is trying to figure out how much damage might be done by the government's redistricting. Help them figure out the worst-case minimum number of districts which are either Guernsey-majority or tied.
INPUT FORMAT (file redistricting.in):
The first line contains a two space-separated integers NN and KK. The second line contains a string of length NN. Each character is either 'H' or 'G', for Holstein or Guernsey.
OUTPUT FORMAT (file redistricting.out):
Please output the minimum possible number of districts that are Guernsey-majority or tied.
SAMPLE INPUT:
7 2 HGHGGHG
SAMPLE OUTPUT:
3
Problem credits: Dhruv Rohatgi
以上就是关于【USACO 2019 January Contest Platinum Problem 1 Redistricting】的解答，如需了解学校/赛事/课程动态，可至翰林教育官网获取更多信息。
往期文章阅读推荐：
USACO计算机奥赛如何认证成绩？2026赛季黄金铂金组“定时开赛”规则详解！
USACO计算机奥赛考试语言是什么？C++、Python、Java选哪个效率最高？
翰林AMC8视频课重磅上线！
国际竞赛真题资源免费领取
