牛客周赛52部分题解

fqsword

于 2024-08-14 00:01:58 发布

阅读量158

点赞数 9

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/song0789/article/details/141175322

版权

比赛地址：牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ (nowcoder.com)

A.两数之和

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    if(n==1||n==2)
    {
        cout<<"NO";
    }
    else
    {
        cout<<"YES"<<endl;
        cout<<1<<" "<<n-1;
    }
    return 0;
 }

B.小红装匣子

include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int n;
    cin>>n;
    long long int a,b,c;
    while(n--)
    {
        cin>>a>>b>>c;
        b/=2;
        b=min(b,c/3);
        if(a>=(c-b*3))
        {
            cout<<"YES"<<endl;
        }
        else
        {
            cout<<"NO"<<endl;
        }
        
    }
    return 0;
}

C.小红的数字对对碰

#include <bits/stdc++.h>
using namespace std;
map<int,int> a;
int main()
{
    
    int m,n;
    cin >> n;
    int n1=n;
    int i1=0,i2=0;
    for (int i = 0; i < n; i++) 
    {
        cin >> m;
        if(m>=0)
        {
            a[m]++;
            i2++;
            if(a[m]==2)
            {
                a[m]=0;
                n1-=2;
                i2-=2;
            }
        }
        else
        {
            i1++;
        }
        
    }
    if(i1>=i2)
    {
        i1-=i2;
        cout<<i1%2;
    }
    else
    {
        cout<<i2-i1;
    }
    return 0;
}

D.小红的最大字典序

#include<bits/stdc++.h>
using namespace std;
struct cmp {
    bool operator()(const string& s1, const string& s2) {
        return s1 < s2; // 倒序排列
    }
};
int main()
{
    int n,m,i;
    cin>>m;
    priority_queue<string,vector<string>,cmp> q;
    string s;
    for(i=1;i<=m;i++)
    {
        cin>>s;
        q.push(s);
    }
    while (!q.empty()) 
    {
        string s = q.top();
        q.pop();
        cout << s[0];
        if (s.length() > 1) 
        {
            q.push(s.substr(1));
        }
    }
    return 0;
}