oj_10_网研

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_38262266/article/details/86512939

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }

    int m;
    cin>>m;
    int b[m];
    for(int i=0;i<m;i++)
    {
        cin>>b[i];
    }

    for(int i=0;i<m;i++)
    {
        int num = 0;
        for(int j=0;j<n;j++)
        {
            num++;
            if(b[i]==a[j])
            {
                cout<<"YES"<<endl;
                break;
            }
            if(num==n-1)
            {
                cout<<"NO"<<endl;
                num = 0;
            }
        }
    }
    return 0;
}

 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    priority_queue<int,vector<int>,greater<int> > q;
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        int a;
        cin>>a;
        q.push(a);
    }
    int key;
    cin>>key;
    for(int i=0;i<key;i++)
    {
        q.pop();
    }
    cout<<q.top();
    return 0;
}

 

#include<bits/stdc++.h>
using namespace std;

int main()
{
    string a;
    cin>>a;
    string b;
    cin>>b;
    int len = b.length();
    int len_a = a.length();
    int num = 0;
    if(len==1)
    {
        for(int i=0; i<len_a; i++)
        {
            if(a[i]-'1'>b[0]-'1')
            {
                num = 1;
                cout<<"YES"<<endl;
                break;
            }
        }
        if(num==0)
            cout<<"NO"<<endl;
    }
    if(len==2)
    {
        int key_b = b[0]-'1'+1;
        for(int i=0; i<len_a-1; i++)
        {
            if(a[i]-'1'+1>key_b
                    &&a[i+1]-'1'+1==a[i]-'1'+1)
            {
                num = 1;
                cout<<"YES"<<endl;
                break;
            }
        }
        if(num==0)
            cout<<"NO"<<endl;
    }
    if(len==3)
    {
        int key_b = b[0]-'1'+1;
        for(int i=0; i<len_a-2; i++)
        {
            if(a[i]-'1'+1>key_b
                    &&a[i+1]-'1'+1==a[i]-'1'+1
                    &&a[i+2]-'1'+1==a[i+1]-'1'+1)
            {
                num = 1;
                cout<<"YES"<<endl;
                break;
            }
        }
        if(num==0)
            cout<<"NO"<<endl;
    }
    if(len==4)
    {
        int key_b = b[0]-'1'+1;
        for(int i=0; i<len_a-3; i++)
        {
            if(a[i]-'1'+1>key_b
                    &&a[i+1]-'1'+1==a[i]-'1'+1
                    &&a[i+2]-'1'+1==a[i+1]-'1'+1
                    &&a[i+3]-'1'+1==a[i+2]-'1'+1)
            {
                num = 1;
                cout<<"YES"<<endl;
                break;
            }
        }
        if(num==0)
            cout<<"NO"<<endl;
    }

    //1133345666777888
    //12345
    if(len==5)
    {
        int add_a[11]={0};
        for(int i=0;i<len_a;i++)
        {
            add_a[a[i]-'1'+1] = 1;
        }
        int key_b = b[0]-'1'+1;
        for(int i=0; i<len_a-4; i++)
        {
            if(i>key_b&&add_a[i]==1
               &&add_a[i+1]==1
               &&add_a[i+2]==1
               &&add_a[i+3]==1
               &&add_a[i+4]==1)
            {
                num=1;
                cout<<"YES"<<endl;
                break;
            }
        }
        if(num==0)
            cout<<"NO"<<endl;
    }
    return 0;
}

 

#include<bits/stdc++.h>
using namespace std;
//树采用完全二叉树存储数组存储
int main()
{
    /*
    1
    2 3
    4 5 6 7
    8 9 10 11 12 13 14 15
    */
    int n;
    cin>>n;
    int a[n+1];
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    int depth;
    cin>>depth;
    int num = 1;
    depth--;
    while(depth--)
    {
        num*=2;
    }
    if(num>n)
    {
        cout<<"EMPTY"<<endl;
    }
    else{
        if(num*2-1<=n)
        {
            for(int i=num;i<num*2;i++)
            {
                if(i==num*2-1)
                    cout<<a[i];
                else
                    cout<<a[i]<<" ";
            }
            cout<<endl;
        }
        if(num*2-1>n)
        {
            for(int i=num;i<=n;i++)
            {
                if(i==n)
                    cout<<a[i];
                else
                    cout<<a[i]<<" ";
            }
            cout<<endl;
        }
    }
    return 0;
}