Andrew Stankevich’s Contest #5
ZOJ2587 Unique Attack 21.20% (263/1240)
ZOJ2588 Burning Bridges 23.92% (410/1714)
ZOJ2589 Circles 18.57% (120/646)
ZOJ2590 Linear Programming Dual 30.65% (42/137)
ZOJ2591 DVD 13.78% (79/573)
ZOJ2592 Think Positive 40.56% (527/1299)
ZOJ2593 Ranking 21.93% (84/383)
ZOJ2594 Driving Straight 19.64% (168/855)

### ZOJ2587 Unique Attack

source code (ZOJ2587.cpp) [FlowNetwork]

### ZOJ2588 Burning Bridges

source code (ZOJ2588.cpp) [Graph]

M个桥连通者N个岛屿，现在一些桥将被烧毁，但岛屿连通性不变，问那些桥一定不会烧毁。

### ZOJ2589 Circles

source code (ZOJ2589.cpp) [geometry, math, Euler's formula]

### ZOJ2590 Linear Programming Dual

source code (ZOJ2590.cpp) [simulation]

### ZOJ2591 DVD

Johnie从他的uncle那继承了一大堆片，不知哪的规矩，看片居然一定要按年份的顺序，更悲剧的是每个片都有个region，DVD要设置成相应的region才能看，DVD只能改5次region。问最多能看多少片，要求输出方案。

### ZOJ2592 Think Positive

$s_{jk}=\left\{\begin{array}{l}\sum_{i=j}^k{a_i},\text{ if }k\ge j;\\\sum_{i=j}^n{a_i}+\sum_{i=1}^k{a_i},\text{ if }k

scanf("%d ", &n);
n *= 5;
gets(s);
n = n - 2 * strlen(s) - 2;
printf("%d\n", n > 0 ? n : 0);


### ZOJ2593 Ranking

source code (ZOJ2593.cpp) [simulation]

### ZOJ2594 Driving Straight

source code (ZOJ2594.cpp) [Graph]

One Response to “Andrew Stankevich’s Contest #5解题报告”
1. Xuanwo says:

n *= 5;
gets(s);
n = n – 2 * strlen(s) – 2;

这个姿势好优越= =，看不懂。

2.