{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"Farmer John has built a new long barn, with N (2 \u0026lt;\u003d N \u0026lt;\u003d 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0 \u0026lt;\u003d xi \u0026lt;\u003d 1,000,000,000).\r\u003cbr\u003e\r\u003cbr\u003eHis C (2 \u0026lt;\u003d C \u0026lt;\u003d N) cows don\u0027t like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ 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?"}},{"title":"Input","value":{"format":"HTML","content":"* Line 1: Two space-separated integers: N and C\r\u003cbr\u003e\r\u003cbr\u003e* Lines 2..N+1: Line i+1 contains an integer stall location, xi"}},{"title":"Output","value":{"format":"HTML","content":"* Line 1: One integer: the largest minimum distance"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5 3\r\n1\r\n2\r\n8\r\n4\r\n9\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"OUTPUT DETAILS:\r\u003cbr\u003e\r\u003cbr\u003eFJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.\r\u003cbr\u003e\r\u003cbr\u003eHuge input data,scanf is recommended."}}]}