NYIST 1083 美丽的校园

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <vector>
 8 #include <queue>
 9 #include <cstdlib>
10 #include <string>
11 #include <set>
12 #include <stack>
13 #define LL long long
14 #define pii pair<int,int>
15 #define INF 0x3f3f3f3f
16 using namespace std;
17 const int maxn = 42;
18 int n,d[maxn];
19 int main() {
20     while(~scanf("%d",&n)){
21         for(int i = 1; i <= n; i++)
22             scanf("%d",d+i);
23         int ans = INF;
24         sort(d+1,d+n+1);
25         for(int i = 1; i < n; i++){
26             int tmp = 0,ds = d[i+1] - d[i];
27             for(int j = i - 1; j > 0; j--)
28                 if(d[i] - d[j] == ds*(j - i)) continue;
29                 else tmp++;
30             for(int j = i + 1; j <= n; j++)
31                 if(d[j] - d[i+1] == ds*(j - i - 1)) continue;
32                 else tmp++;
33             ans = min(ans,tmp);
34         }
35         printf("%d\n",ans);
36     }
37     return 0;
38 }