𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Maximum Similarity - C++ HackerEarth Solutions

#include <bits/stdc++.h>

using namespace std;
int main()
{
    int t;
    cin>>t;

    while(t--)
    {
        string str1, str2;
        cin>>str1>>str2;

        map<char,int> mp2;

        for(int i=0;i<str2.size();i++)
        mp2[str2[i]]++;

        int result=0;

        for(int i=0;i<str1.size();i++)
        {
            if(mp2[str1[i]]>0)
            {
                result++;
                mp2[str1[i]]--;
            }

            else
            break;
        }
        cout<<result<<endl;
    }
    return 0;
}

❤1

642 viewsサンケットクマール, 15:02

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

✅✅✅#HackerEarth Coin collector - C++ HackerEarth Solutions

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

long long solve (int N, vector<long long> A, int X) {
    vector<long long>dp(N);     
    long long best_odd_score, best_even_score;
    if (A[0] % 2 == 0)
        best_even_score = A[0], best_odd_score = -X;
    else
        best_odd_score = A[0], best_even_score = -X;
    for (int i = 1; i < N; i++)
    {
        if (A[i] % 2)
        {
            dp[i] = max(best_odd_score + A[i], best_even_score - X + A[i]);
            best_odd_score = max(best_odd_score, dp[i]);
        }
        else
        {
            dp[i] = max(best_even_score + A[i], best_odd_score - X + A[i]);
            best_even_score = max(best_even_score, dp[i]);
        }
    }
    return dp[N - 1];
}

int main() {

    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    for (int t_i = 0; t_i < T; t_i++)
    {
        int N;
        cin >> N;
        vector<long long> A(N);
        for (int i_A = 0; i_A < N; i_A++)
        {
            cin >> A[i_A];
        }
        int X;
        cin >> X;

        long long out_;
        out_ = solve(N, A, X);
        cout << out_;
        cout << "\n";
    }
}