本文介绍了Arya在学校中与对手进行战斗的问题。每天，如果至少有一个对手缺席，Arya就会击败所有在场的对手。如果所有对手都出席，他们将击败Arya。给定每个对手的出勤计划，目标是找出连续战胜所有在场对手的最长时间。输入包括对手数量、天数和每天的出勤情况，输出是最大的连续胜利天数。样例输入和输出展示了如何计算这个值。
A. Opponents
Description
Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this plan requires presence of them all. That means if one day at least one of Arya's opponents is absent at the school, then Arya will beat all present opponents. Otherwise, if all opponents are present, then they will beat Arya.
For each opponent Arya knows his schedule — whether or not he is going to present on each particular day. Tell him the maximum number of consecutive days that he will beat all present opponents.
Note, that if some day there are no opponents present, Arya still considers he beats all the present opponents.
Input
The first line of the input contains two integers n and d (1 ≤ n, d ≤ 100) — the number of opponents and t
最低0.47元/天 解锁文章
546
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
