Krydom: 暁の水平线に胜利を刻むのです

ソロモンの悪夢、見せてあげる!

@krydom2年前

10/6
00:01
未分类 线段树

[bzoj 1012] JSOI2008 最大数maxnumber

00:00/00:00

62268a13632762d04e033289a6ec08fa513dc616   da15a9ec8a136327dad05405978fa0ec08fac716

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

 现在请求你维护一个数列,要求提供以下两种操作: 1、 查询操作。语法:Q L 功能:查询当前数列中末尾L个数中的最大的数,并输出这个数的值。限制:L不超过当前数列的长度。 2、 插入操作。语法:A n 功能:将n加上t,其中t是最近一次查询操作的答案(如果还未执行过查询操作,则t=0),并将所得结果对一个固定的常数D取模,将所得答案插入到数列的末尾。限制:n是非负整数并且在长整范围内。注意:初始时数列是空的,没有一个数。

Read More →

[bzoj 1012] JSOI2008 最大数maxnumber

@krydom2年前

09/19
20:15
贪心

[bzoj 2020] Usaco2010Jan Buying Feed, II

00:00/00:00

20150402H2339_ytjx2   11277199081e0c0014o

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

Farmer John needs to travel to town to pick up K (1 <= K <= 100) pounds of feed. Driving D miles with K pounds of feed in his truck costs D*K cents. The county feed lot has N (1 <= N <= 100) stores (conveniently numbered 1..N) that sell feed. Read More →

[bzoj 2020] Usaco2010Jan Buying Feed, II

@krydom2年前

09/12
23:56
kruskal

Usaco2004Dec Bad Cowtractors [bzoj 3390 poj 2377]

00:00/00:00

u=3692212660,1094370080&fm=21&gp=0   93d6b72bd40735fa9b8875329e510fb30e24080a

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

    奶牛贝茜被雇去建设N(2≤N≤1000)个牛棚间的互联网.她已经勘探出M(1≤M≤20000)条可建的线路,每条线路连接两个牛棚,而且会苞费C(1≤C≤100000).农夫约翰吝啬得很,他希望建设费用最少甚至他都不想给贝茜工钱. 贝茜得知工钱要告吹,决定报复.她打算选择建一些线路,把所有牛棚连接在一起,让约翰花费最大.但是她不能造出环来,这样约翰就会发现.

Read More →

Usaco2004Dec Bad Cowtractors [bzoj 3390 poj 2377]

@krydom2年前

09/12
19:51
bfs

[bzoj 3392] Usaco2005Feb Part Acquisition 交易

00:00/00:00

20140811133326_yLWWZ   6-121225103Z5

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

     奶牛们接到了寻找一种新型挤奶机的任务,为此它们准备依次经过N(1≤N≤50000)颗行星,在行星上进行交易.为了方便,奶牛们已经给可能出现的K(1≤K≤1000)种货物进行了由1到K的标号.由于这些行星都不是十分发达.没有流通的货币,所以在每个市场里都只能用固定的一种货物去换取另一种货物.    奶牛们带着一种上好的饲料从地球出发,希望进行最少的交易,最终得到所需要的机器.饲料的标号为1,所需要的机器的标号为K.如果任务无法完成,输出-1.

Read More →

[bzoj 3392] Usaco2005Feb Part Acquisition 交易

@krydom2年前

09/6
01:05
贪心

[bzoj 1680] Usaco2005Mar Yogurt factory

00:00/00:00

c788fc759168cab817d66e240f72b1c2   1Z253A33-1

♦♦♦♦♦♦   Description   ♦♦♦♦♦♦

The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the company C_i (1 <= C_i <= 5,000) cents to produce one unit of yogurt in week i. Yucky's factory, being well-designed, can produce arbitrarily many units of yogurt each week. Yucky Yogurt owns a warehouse that can store unused yogurt at a constant fee of S (1 <= S <= 100) cents per unit of yogurt per week. Read More →

[bzoj 1680] Usaco2005Mar Yogurt factory