随笔分类 - OJ -- USACO
摘要：Description Bessie is playing a video game! In the game, the three letters 'A', 'B', and 'C' are the only valid buttons. Bessie may press the buttons
阅读全文
摘要：Description Farmer John has purchased a subscription to Good Hooveskeeping magazine for his cows, so they have plenty of material to read while waitin
阅读全文
摘要：Description [Brian Dean, 2012] Farmer John's cows are all of a very peculiar breed known for its distinctive appearance each cow is marked with a gian
阅读全文
摘要：Description Farmer John's owns N cows (2 include include include include define inf 0x7f7f7f7f using namespace std; typedef long long ll; typedef unsi
阅读全文
摘要：Description Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an i
阅读全文
摘要：Description Farmer John is continuing to ponder the issue of cows crossing the road through his farm, introduced in the preceding problem. He realizes
阅读全文
摘要：Description Farmer John正在一个新的销售区域对他的牛奶销售方案进行调查。他想把牛奶送到T个城镇 (1 5，4 6和1 3，花费分别是 100， 100， 10。FJ的中心城镇在城镇4。 NO PATH NO PATH 5 0 95 100 样例输出解释： FJ的奶牛从4号城镇开
阅读全文
摘要：Description 为了表示不能输给人类，农场的奶牛们决定成立一家航空公司．她们计划每天早晨，从密歇根湖湖岸的最北端飞向最南端，晚上从最南端飞往最北端．在旅途中，航空公司可以安排飞机停在某些机场．他们需要你帮助来决定每天携带哪些旅客．沿着湖岸，有N(1≤N≤10000)个由北至南编号为1到N的农
阅读全文
摘要：Description 到冬天了，这意味着下雪了！从农舍到牛棚的路上有N块地砖，方便起见编号为1…N，第i块地砖上积了fi英尺的雪。在Farmer John的农舍的地窖中，总共有B双靴子，编号为1…B。其中某些比另一些结实，某些比另一些轻便。具体地说，第i双靴子能够让FJ在至多si英尺深的积雪中行走
阅读全文
摘要：Description N(1 two total Feature 2: 1 1 0 0 two total Feature 1: 1 0 1 0 two total Key: 7 2 1 4 Cow : 3 4 5 6 这题我们推推柿子，我们首先记录一下前缀和 sum "i][k]，表示到第i头牛
阅读全文
摘要：Description Farmer John is at the market to purchase supplies for his farm. He has in his pocket K coins (1 include include include include define inf
阅读全文
摘要：Description Bessie is out at the movies. Being mischievous as always, she has decided to hide from Farmer John for L (1 include include include includ
阅读全文
摘要：Description Farmer John自豪于他所经营的交通发达的的农场。这个农场是由N块牧场（2≤N≤50,000）组成的，N 1条双向道路将它们连接起来，每一条道路的都为一单位长度。Farmer John注意到，从任何一块牧场到另一块牧场，都能通过一组合适的道路到达。尽管FJ的农场现在是连
阅读全文
摘要：Description Farmer John的N头奶牛（1≤N≤10^5），仍然编号为1…N，正好闲得发慌。因此，她们发展了一个与Farmer John每天早上为她们挤牛奶的时候的排队顺序相关的复杂的社会阶层。经过若干周的研究，Farmer John对他的奶牛的社会结构总计进行了M次观察（1≤M≤
阅读全文
摘要：Description FarmerJohn要带着他的N头奶牛，方便起见编号为1…N，到农业展览会上去，参加每年的达牛秀！他的第i头奶牛重量为wi，才艺水平为ti，两者都是整数。在到达时，FarmerJohn就被今年达牛秀的新规则吓到了：（一）参加比赛的一组奶牛必须总重量至少为W（这是为了确保是强大
阅读全文
摘要：Description 雨连续不断的击打了放牛的牧场，一个R行C列的格子(1 include include include include define inf 0x7f7f7f7f using namespace std; typedef long long ll; typedef unsign
阅读全文
摘要：Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 include include include include
阅读全文
摘要：Description N (2 include include include include using namespace std; const int N=8e3; int tree[N 3+10],a[N+10],ans[N+10]; inline int read(){ int x=0,
阅读全文
摘要：Description Farmer John's N (1 =0)$$ 不过肯定会T就是了。我们考虑每次转移只考虑到sum[i]与sum[j]的大小关系，于是我们只要将前缀和离散化一下然后丢到树状数组里处理下就好了 include include include include include d
阅读全文
摘要：Description Farmer John has taken the cows to a vacation out on the ocean! The cows are living on N (1 include include include include define inf 0x7f
阅读全文
