vickey

疯牛 时间限制：1000 ms | 内存限制：65535 KB 农夫 John 建造了一座很长的畜栏，它包括N (2 但是，John的C (2 输入 有多组测试数据，以EOF结束。 第一行：空格分隔的两个整数N和C 第二行——第N+1行：分别指出了xi的位置 输出 每组测试数据输出一个整数，满足题意的最大的最小值 思路：这个题一上来真的是被它原有的AC率——18% 吓到了。

题意： 给一计算

http://codeforces.com/contest/448/problem/D

C. Painting Fence time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Bizon the Champion isn't just attentive, he also is

Aggressive cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6030   Accepted: 3016 Description Farmer John has built a new long barn, with N (2 His C (2

Cable master Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 23362   Accepted: 4995 Description Inhabitants of the Wonderland have decided to hold a regional p

题意：求最少复习天数 &

Cup Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4292    Accepted Submission(s): 1351 Problem Description The WHU ACM Team has a big