洛谷 P1881 绳子对折

小水题

模拟

//P1881 绳子对折
//2017.4.11

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAXN = 100 + 2;
int n, l, s[MAXN], ans;

int judge1(int mid){
    for (int i = mid - 1, j = mid + 1; i > 0 && j <= n; i--, j++)
        if (s[mid] - s[i] != s[j] - s[mid]) return false;
    return true;
}

int judge2(int mid1){
    int mid2 = mid1 + 1, i, j;
    for (i = mid1 - 1, j = mid2 + 1; i > 0 && j <= n; i--, j++)
        if (s[mid1] - s[i] != s[j] - s[mid2]) return false;
    return true;
}

int main(){
    scanf("%d%d", &n, &l);
    for (int i = 1; i <= n; i++)
        scanf("%d", &s[i]);
    sort(s + 1, s + n + 1);

//  cout << endl;

    //在节点处对折 
    for (int i = 2; i < n; i++)
        if (judge1(i)){
//          cout << s[i] << endl;
            ans++;
        }

    //在i节点与i + 1节点中点处对折 
    for (int i = 1; i < n; i++)
        if (judge2(i)){
//          cout << s[i] << " - " << s[i + 1] << endl;
            ans++;
        }

    cout << ans; 

    return 0;
}