Yogurt factory
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 < >>继续阅读
poj3190
maksyuki 发表于 oj 分类，标签: 基础算法-贪心, 数据结构-队列\双端\单调\优先
09
10月
2015
Stall Reservations
Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviously, FJ must c >>继续阅读
poj2376
07
10月
2015
Cleaning Shifts
Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1, >>继续阅读
poj3050
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
02
10月
2015
Hopscotch
The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cows create a 5x5 rectilinear grid of digits parallel to the x and y axes.
They then adroitly hop ont >>继续阅读
poj3669
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
01
10月
2015
Meteor Shower
Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they hit. Anxious for her safety, she vows to find her way to a safe location (one that is never des >>继续阅读
poj2431
maksyuki 发表于 oj 分类，标签: 基础算法-贪心, 数据结构-队列\双端\单调\优先
01
10月
2015
Expedition
A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck's fuel tank. The truck >>继续阅读
poj3069
01
10月
2015
Saruman's Army
Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the troops. Each palantir >>继续阅读
poj3617
01
10月
2015
Best Cow Line
FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds them past the judges.
The contest organizers adopted a new registration >>继续阅读
bzoj1087
25
9月
2015
1087: [SCOI2005]互不侵犯King
Description
在N×N的棋盘里面放K个国王，使他们互不攻击，共有多少种摆放方案。国王能攻击到它上下左右，以及左上左下右上右下八个方向上附近的各一个格子，共8个格子。
Input
只有一行，包含两个数N，K （ 1 <=N <=9, 0 <= K <= N * N） >>继续阅读
poj2385
24
9月
2015
Apple Catching
It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apples when they are on the tree, so she must wait >>继续阅读
poj3659
24
9月
2015
Cell Phone Network
Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell phone towers on his N (1 ≤ N ≤ 10,000) pastures (conveniently numbered 1..N >>继续阅读
poj1463
22
9月
2015
Strategic game
Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a >>继续阅读
ural1018
22
9月
2015
1018. Binary Apple Tree
Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enumerate by integers the root of binary ap >>继续阅读
poj2063
22
9月
2015
Investment
John never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only inheritor.
John did not need that muc >>继续阅读
poj1014
20
9月
2015
Dividing
Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just spli >>继续阅读
