暑假算法复习

8月5日

Problem - B - Codeforces

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long n;
    cin>>n;
    long long N;
    long long now;
    for(long long i =0;i<n;i++)
    {
        long long flag = 0;
        long long sum = 0;
        long long ji = 0;
        long long ou = 0;
        long long maxji= 0;
        long long maxou = 0;
        cin>>N;
        vector<long long> arr(N);
        for(long long j =0;j<N;j++)
        {
            cin>>arr[j];
            if(arr[j]%2==0)
            ou++;
        }
        sort(arr.begin(),arr.end());
        if(arr[0]==arr[N-1]||ou==0||ou==N)
        {
            cout<<0<<endl;
            continue;
        }
        for(long long j =N-1;j>0;j--)
        {
            if(arr[j]%2==1)
            {
                maxji=arr[j];
                break;
            }
        }
        for(long long j =0;j<N;j++)
        {
            if(arr[j]%2==1)
            continue;
            if(maxji>arr[j])
            {
                maxji +=arr[j];
                sum++;
            }
            else
            {
                cout<<ou+1<<endl;
                flag = 1;
                break;
            }

        }
        if(flag==0)
        {
            cout<<sum<<endl;
        }

    }
}

8月11

Problem - D - Codeforces

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    getchar();
    while (n--)
    {
        char haha = '0';
        string man;
        getline(cin, man);
        string pupos;
        getline(cin, pupos);
        int oj = 0;
        int flag = 0;
        int op = 0;
        for (int i = 0; i < man.size(); i++)
        {
            flag = i;
            if (man[i] == pupos[oj])
            {
                oj++;
                
            }
            if (man[i] == '?')
            {
                man[i] = pupos[oj];
                oj++;
              
            }
            if (oj >= pupos.size())
            {
                op = 1;
                break;
            }
        }
        for (int i = flag; i < man.size(); i++)
        {
            if (man[i] == '?')
            {
                man[i] = 'a';
            }
        }
        if (op == 1)
        {
            cout << "YES" << endl;
            cout << man << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
}