2014-12-18 13:40:50
思路：前三题敲慢了...导致D时间不足。
A：暴力枚举。
1 #include <cstdio> 2 #include <cstring> 3 #include <cstdlib> 4 #include <cmath> 5 #include <vector> 6 #include <map> 7 #include <set> 8 #include <stack> 9 #include <queue> 10 #include <iostream> 11 #include <algorithm> 12 using namespace std; 13 #define lp (p << 1) 14 #define rp (p << 1|1) 15 #define getmid(l,r) (l + (r - l) / 2) 16 #define MP(a,b) make_pair(a,b) 17 typedef long long ll; 18 typedef unsigned long long ull; 19 const int INF = 1 << 30; 20 21 int n; 22 int a[110]; 23 int ans = INF; 24 25 int main(){ 26 scanf("%d",&n); 27 for(int i = 1; i <= n; ++i) scanf("%d",a + i); 28 sort(a + 1,a + n + 1); 29 for(int i = 2; i < n; ++i){ 30 int d = 0; 31 for(int j = 2; j <= n; ++j){ 32 if(j == i){ 33 d = max(d,a[j + 1] - a[j - 1]); 34 ++j; 35 } 36 else d = max(d,a[j] - a[j - 1]); 37 } 38 ans = min(ans,d); 39 } 40 printf("%d\n",ans); 41 return 0; 42 }