Aggressive cows +-+-+- +-+-+- +-+-+- +-+-+-+ NOTE: this problem is only available to first-time ACMers... HOWEVER: the web version (HTML 5 canvas + JQuery/Ajax) is available to all. +-+-+- +-+-+- +-+-+- +-+-+-+ Farmer Maria has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x_1, ..., x_N (0 <= x_i <= 1,000,000,000). Her C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FM want to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance? PROBLEM NAME: aggr INPUT FORMAT: * Line 1: Two space-separated integers: N and C * Lines 2..N+1: Line i+1 contains an integer stall location, x_i SAMPLE INPUT: 5 3 1 2 8 4 9 OUTPUT FORMAT: * Line 1: One integer: the largest minimum distance SAMPLE OUTPUT (file aggr.out): 3 OUTPUT DETAILS: FM can put her 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.