[USACO23DEC] Candy Cane Feast B Python

先看题目：

Farmer John's cows have quite the sweet tooth, and they especially enjoy eating candy canes! FJ has N total cows, each with a certain initial height and he wants to feed them M candy canes, each also of varying height (1≤N,M≤2⋅105).

FJ plans to feed the candy canes one by one to the cows, in the order they are given in the input. To feed a candy cane to his cows, he will hang the candy cane so that initially the candy cane is just touching the ground. The cows will then line up one by one, in the order given by the input, and go up to the candy cane, each eating up to their height (since they cannot reach any higher). The candy cane stays suspended in place where it is initially set up and is not lowered to the ground, even after cows eat the bottom of the candy cane. It is possible a cow may eat nothing during her turn, if the base of the candy cane is already above that cow's height. After every cow has had their turn, the cows grow in height by how many units of candy cane they ate, and Farmer John hangs the next candy cane and the cows repeat the process again (with cow 1 again being the first to start eating the next candy cane).

啥？你看不懂英语？嘿嘿，我也看不懂，下面为翻译：

Farmer John 的奶牛对甜食情有独钟，它们尤其喜欢吃糖果棒。FJ 共有 N 头奶牛，每头奶牛都有一个特定的初始高度。他想要喂它们 M 根糖果棒，每根糖果棒的高度也各不相同（1≤N,M≤2⋅105）。

FJ 计划按照输入给出的顺序，逐一喂给奶牛们糖果棒。然后，奶牛们会按照输入给出的顺序一个接一个地排队，走向糖果棒，每头奶牛最多吃到与它高度相同的部分（因为它们够不到更高的地方）。即使奶牛吃掉了糖果棒的底部，糖果棒也在最初悬挂的地方保持不动，并不会被降低到地面。如果糖果棒的底部已经高于某头奶牛的高度，那么这头奶牛在它的回合中可能什么也吃不到。每头奶牛轮流吃过后，它们的身高会增加它们吃掉的糖果棒的单位数量，然后农夫约翰挂上下一根糖果棒，奶牛们再次重复这个过程（第一头奶牛再次成为第一个开始吃下一根糖果棒的）。

接下来，我们看看输入输出：

输入：

3 2
3 2 5
6 1

输出：

7
2
7

代码环节：

首先输入：

n,m=[int(i) for i in input().split()]#n=几个奶牛，m=几根甘蔗糖
ch=[int(i) for i in input().split()]#奶牛的高度
cb=[int(i) for i in input().split()]#甘蔗糖的高度

然后让我们想一下，是for奶牛数量还是甘蔗糖（管你for哪个，反正我for的是甘蔗糖）

for i in cb:

接下来我们设置个变量：

tot=0#糖果在哪里（高度）

o=-1

然后下面for是关于奶牛吃甘蔗糖:

for f in ch:
    o+=1
    if f<=tot:
        continue
    x=f-tot#cow 有能力吃多少
    if i<=x:#供不应求
        ch[o]+=i
        break#优化1
    else:
        ch[o] += x
        tot+=x
        i-=x

最后是输出：

for i in ch:
    print(i)