题意:
给出一个有序的数列.
求由 A[l1]~A[r1] 与 A[l2]~A[r2] 组成的新序列的中位数.
题解:
把区间分成三部分,其中一个是相交部分,然后找中位数就好了;
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 100100
#define MOD 1000000007
int n,m;
int a[100010];
int l1,r1,l2,r2;
int solve(int len)
{
if(r1 <= l2)
{
if(r1-l1+1 >= len)
return a[l1+len-1];
else
{
len -= r1 - l1 + 1;
return a[l2+len-1];
}
}
else
{
if(l2-l1 >= len)
return a[l1+len-1];
else if(l2-l1+(r1-l2+1)*2 < len)
{
len -= r1-l1+1;
return a[l2+len-1];
}
else
{
len -= l2 - l1;
if(len & 1)
return a[l2+len/2];
else
return a[l2+len/2-1];
}
}
}
int main()
{
//freopen("1001.in","r",stdin);
//freopen("out.txt","w",stdout);
int t,C = 1;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++)
scanf("%d",&a[i]);
while(m--)
{
scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
if(l1 > l2)
swap(l1,l2);
if(r1 > r2)
swap(r1,r2);
int len = r1 - l1 + 1 + r2 - l2 + 1;
if(len & 1)
printf("%.1f\n",1.0*solve(len/2+1));
else
printf("%.1f\n",0.5*solve(len/2)+0.5*solve(len/2+1));
}
}
return 0;
}