uva 10057 A mid-summer night's dream.

来源：互联网发布：钢琴键盘软件编辑：程序博客网时间：2024/05/22 12:56

题意：懂得意思的话就是蛮水的一道题，要使等式最小，我们可以求中位数，而当个数是偶数的时候，我们取左的，然后还要求个数和差

#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <cmath>using namespace std;const int MAXN = 1000005;int arr[MAXN],n;int main(){   while (scanf("%d",&n) != EOF)    {       for (int i = 0; i < n; i++)           scanf("%d",&arr[i]);             sort(arr,arr+n);       int left,right,ans_min,ans_num,ans_val,mid;       if (n % 2 == 0)       {           left = (n-2) / 2,right = n / 2;           ans_min = arr[left];           ans_num = 0;           for (int i = left; arr[i] == arr[left] && i >= 0; i--)               ans_num++;           for (int i = right; arr[i] == arr[right] && i < n; i++)               ans_num++;           ans_val = arr[right] - arr[left] + 1;       }       else        {            mid = (n-1) / 2;            ans_min = arr[mid];            ans_num = 0;            for (int i = mid; i < n && arr[i] == arr[mid]; i++)                ans_num++;            for (int i = mid - 1; i >= 0 && arr[i] == arr[mid]; i--)                ans_num++;            ans_val = 1;       }       printf("%d %d %d\n",ans_min,ans_num,ans_val);   }   return 0;}