HDU Median （乱搞）

中位数是值在中间的数

因为给出的序列是有序的，所以只要判断新序列每个数出现的次数就可以了（只可能是0，1，2次），然后分类讨论，这个讨论还是挺烦的

/* ***********************************************
Author        :angon

************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k)  memset(a,k,sizeof(a))
#define LL long long
#define N 1005
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}

long long a[100005];
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t;
    int m,n;
    scan(t);
    while(t--)
    {
        scann(n,m);
        REPP(i,1,n) scanl(a[i]);
        sort(a+1,a+n+1);
        int l1,r1,l2,r2;
        int p,p1,p2;
        while(m--)
        {
            double mid=0;

            scann(l1,r1);scann(l2,r2);
            if(l1>l2)
            {
                swap(l1,l2);
            }
            if(r1>r2)
            {
                swap(r1,r2);
            }
            int len=r1-l1+1+r2-l2+1;
            int flag=0;
            if(r1-l2<0)
            {
                flag=1;
            }
            if(flag)
            {
                if(len&1)
                {
                    if(r1-l1+1>=len/2+1)
                    {
                        p = l1+len/2;
                    }
                    else
                    {
                        p = l2 + len/2 - (r1-l1)-1 ;
                    }
                    mid=a[p];
                }
                else
                {
                    if(r1-l1+1>=len/2+1)
                    {
                        p1 = l1+len/2-1;
                        p2 = p1+1;
                    }
                    else if(len/2 > r1-l1+1)
                    {
                        p1 = len/2 - (r1-l1+1) + l2 -1;
                        p2 = p1+1;
                    }
                    else
                    {
                        p1 = r1;
                        p2 = l2;
                    }
                    mid=(a[p1]+a[p2])/2.0;
                }
            }
            else
            {
                int len1 = l2 - l1;
                int len2 = r1 - l2 + 1;
                if(len&1)
                {
                    if(len1>=len/2+1)
                    {
                        p = l1+len/2;
                    }
                    else if(len2*2+len1>=len/2+1)
                    {
                        p = l2 + ceil((len/2+1-len1)/2.0)-1;
                    }
                    else
                    {
                        p = r1+len/2+1-len2*2-len1;
                    }
                    mid=a[p];
                }
                else
                {
                    if(len1>=len/2+1)
                    {
                        p1 = l1+len/2-1;
                        p2 = p1+1;
                    }
                    else if(len1==len/2&&len1<len/2+1)
                    {
                        p1 = l2-1;
                        p2 = l2;
                    }
                    else if(len1+len2*2>=len/2+1)
                    {
                        p1 = l2 + ceil((len/2-len1)/2.0)-1;
                        if((len/2-len1)%2==0)p2 = p1+1;
                        else p2=p1;
                    }
                    else if(len1+len2*2==len/2&&len1+len2*2<len/2+1)
                    {
                        p1 = r1;
                        p2 = r1+1;
                    }
                    else
                    {
                        p1 = r1+len/2-len2*2-len1;
                        p2 = p1+1;
                    }
                    mid=(a[p1]+a[p2])/2.0;
                }
            }
            printf("%.1lf\n",mid);

        }
    }

    return 0;
}