Codeforces Round #793 (Div. 2) 1682C - LIS or Reverse LIS? Solution



 Problem Link:  https://codeforces.com/contest/1682/problem/C

Solve in C++:  

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long  n,i,j,cn,mx,t;
    cin>>t;
    while(t--)
    {
        cn=0;
        cin>>n;
        int a[n];
        map<int,int>mp;
        set<int>st;
        for(i=0; i<n; i++)
        {
            cin>>a[i];
            st.insert(a[i]);
            mp[a[i]]++;
        }
        for(auto it=st.begin(); it!=st.end(); it++)
        {
            if(mp[*it]>=2)
                cn+=2;
            else
                cn++;
        }
        cout<<(cn+1)/2<<endl;
    }
    return 0;
}



No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.