![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
gold
文章平均质量分 71
wang3312362136
这个作者很懒,什么都没留下…
展开
-
[Usaco2007 Nov]tanning分配防晒霜
Description 奶牛们计划着去海滩上享受日光浴。为了避免皮肤被阳光灼伤,所有C(1<=C<=2500)C(1 <= C <= 2500)头奶牛必须在出门之前在身上抹防晒霜。第i头奶牛适合的最小和最 大的SPF值分别为minSPFiminSPF_i和maxSPFimaxSPF_i(1<=minSPFi<=1,0001 <= minSPF_i <= 1,000; minSPFi<=maxSPF原创 2017-09-26 17:08:17 · 430 阅读 · 0 评论 -
[Usaco2009 Feb]庙会捷运Fair Shuttle
Description 公交车一共经过N(1<=N<=20000)N(1<=N<=20000)个站点,从站点1一直驶到站点NN。K(1<=K<=50000)K(1<=K<=50000)群奶牛希望搭乘这辆公交车。第ii群牛一共有Mi(1<=Mi<=N)M_i(1<=M_i<=N)只。他们希望从SiS_i到EiE_i去。公交车只能座C(1<=C<=100)C(1<=C<=100)只奶牛。而且不走重复路原创 2017-09-26 22:25:25 · 245 阅读 · 0 评论 -
[Usaco2013 Feb]Taxi
Description Bessie is running a taxi service for the other cows on the farm. The cows have been gathering at different locations along a fence of length M(1<=M<=1,000,000,000)M (1 <= M <= 1,000,000,00原创 2017-09-27 10:54:52 · 470 阅读 · 1 评论 -
[Usaco2011 Mar]Brownie Slicing
Description Bessie烘焙了一块巧克力蛋糕。这块蛋糕是由R∗C(1<=R,C<=500)R*C(1 <= R,C <= 500)个小的巧克力蛋糕组成的。 第ii行,第jj列的蛋糕有Nij(1<=Nij<=4,000)N_{ij}(1 <= N_{ij} <= 4,000)块巧克力碎屑。 Bessie想把蛋糕分成A∗BA*B块,(1<=A<=R,1<=B<=C)(1 <= A <= R原创 2017-09-27 16:10:13 · 353 阅读 · 0 评论