➤ Problem Link : CODERE3
👉 Hint : Simple DP Problem
✅ C++ Solution :
#include<bits/stdc++.h>
using namespace std;
int arr[1001];
pair<int,int> dp[1001];
int main()
{
int t;
cin>>t;
while(t--)
{
int n,ans=0;
cin>>n;
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n;i++)
{
dp[i].first=1;
for(int j=i-1;j>=0;j--)
if(arr[j]<arr[i])
dp[i].first=max(dp[i].first,1+dp[j].first);
}
for(int i=n-1;i>=0;i--)
{
dp[i].second=1;
for(int j=i+1;j<n;j++)
if(arr[j]<arr[i])
dp[i].second=max(dp[i].second,1+dp[j].second);
}
for(int i=0;i<n;i++)
ans=max(ans,dp[i].first+dp[i].second-1);
cout<<ans<<endl;
}
}
Thank you for your patience reading. If you enjoyed this post, I’d be very grateful if you’d help it spread by emailing it to a friend, or sharing it on Whatsapp or Facebook.
😇Happy Learning!!
I am a Member Technical at D.E. Shaw India Pvt. Ltd. CodingWithArt is a blog where you find tricks and solutions to challenging coding and development problems. I aim to build a universal tech platform for every enthusiast out there.