two points 1029 Median (25 分)(**)

最新推荐文章于 2024-04-19 20:30:00 发布

Togyu

最新推荐文章于 2024-04-19 20:30:00 发布

阅读量80

点赞数

分类专栏： c语言重做

本文链接：https://blog.csdn.net/qq_15556537/article/details/90812871

版权

c语言同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

重做

50 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 200010;

void getMidian(long int a[],long int b[],int r1,int r2)
{
    int l1,l2;
    l1 = l2 = 0;
    int mid;
    if((r1+r2)%2 == 0)
        mid = (r1 + r2)/2;
    else
        mid = (r1 + r2)/2 + 1;
//    long int temp[4000];
    int index = 0;
    while(l1 < r1 && l2 < r2)
    {
        if(a[l1] < b[l2])
        {
//          temp[index++] = a[l1++];
            l1++;
            index++;
            if(index == mid)
            {
                printf("%d",a[l1 - 1]);
                return;
            }
        }
        else
        {
//          temp[index++] = b[l2++];
            index++;
            l2++;
            if(index == mid)
            {
                printf("%d",b[l2 - 1]);
                return;
            }
        }

    }
    while(l1 < r1)
    {
//          temp[index++] = a[l1++];
            index++;
            l1++;
            if(index == mid)
            {
                printf("%d",a[l1 - 1]);
                return;
            }
    }

    while(l2 < r2)
    {
//          temp[index++] = b[l2++];
            index++;
            l2++;
            if(index == mid)
            {
                printf("%d",b[l2 - 1]);
                return;
            }
    }


}

int main()
{

    int n1,n2;
    long int a[N],b[N];

    scanf("%d",&n1);
    for(int i = 0;i<n1;i++)
    {
        scanf("%ld",&a[i]);
    }
    scanf("%d",&n2);
    for(int i = 0;i<n2;i++)
    {
        scanf("%ld",&b[i]);
    }
    a[n1] = b[n2] = 1<<31-1;
    getMidian(a,b,n1,n2);

}

后面四个点内存超限了。

只开一个数组来做

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 200010;


int main()
{

    int n1,n2,countnum = 0,i,j;
    long a[N];

    scanf("%d",&n1);
    for(i = 1;i<=n1;i++)
    {
        scanf("%ld",&a[i]);
    }
    a[n1 + 1] = 1<<31-1;
    scanf("%d",&n2);
    i=1;
    int mid = (n1 + n2 + 1)/2;
    for(j = 1;j<=n2;j++)
    {
        long temp;
        scanf("%ld",&temp);
        while(a[i] < temp)
        {
            countnum++;
            if(countnum == mid) printf("%d",a[i]);
            i++;
        }
        countnum++;
        if(countnum == mid) printf("%d",temp);
    }
    while(i<=n1)
    {
        countnum++;
        if(countnum == mid) printf("%d",a[i]);
        break;
    }
}

还是超限啊啊啊啊

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 200010;

int main()
{

    int n1,n2,countnum = 0,i,j;
    int a[N];

    scanf("%d",&n1);
    for(i = 1;i<=n1;i++)
    {
        scanf("%d",&a[i]);
    }
    a[n1 + 1] = 1<<31-1;
    scanf("%d",&n2);
    i=1;
    int mid = (n1 + n2 + 1)/2;
    for(j = 1;j<=n2;j++)
    {
        int temp;
        scanf("%d",&temp);
        while(a[i] < temp)
        {
            countnum++;
            if(countnum == mid) printf("%d",a[i]);
            i++;
        }
        countnum++;
        if(countnum == mid) printf("%d",temp);
    }
    while(i<=n1)
    {
        countnum++;
        if(countnum == mid) printf("%d",a[i]);
        i++;
    }
}

你妹的题目骗人啊有没有有没有！！！
更本就是只需要int 就好了 longint 就超限