Improved upon the idea of tutorial for longest increasing subsequence on geeks for geeks and solved it easily in one go without the help of any hint.

Here is a sweet and simple implementation of the above.

#include<bits/stdc++.h>
using namespace std;
int main(){
  int n;  cin>>n;
 
  vector<int> a(n),l(n,1);//a is element array,l is longest increasing subsequence at l[i]
  vector<bool> s(n);//s is sign array 1 for positive and 0 for negative
 
  for(int i=0;i<n;i++){
    cin>>a[i];
    if(a[i]>0)
      s[i]=1;
    else
      s[i]=0;
  }
 
  for(int i=1;i<n;i++)

My simple solution using bottom up approach for those who are wondering:

PS:hints from Ashish SB helped me:

#include<bits/stdc++.h>
#define ll long long
 
using namespace std;
 
int main(){
  #ifndef ONLINE_JUDGE
  freopen("input.txt","r",stdin);
  freopen("output.txt","w",stdout);
  #endif
   int t;  cin>>t;
   while(t--){
     string s;  cin>>s;
     int dp[s.size()][s.size()];
     for(int i=0;i<s.size();i++)
       for(int j=0;j<=i;j++)
         dp[i][j]=0;
     

A Simple implementation of above using C++

#include<bits/stdc++.h>
 
using namespace std;
 
vector<int> a;    //global version of local parameter to avoid parameter passing
vector<vector<int>> dp;    //global version 
int rec(int day,int rest){
    if(day==a.size())
        return 0;
    if(rest==3)
        return INT_MAX;
	if(dp[day][rest]!=-1)
		return dp[day][rest];
	else{
        dp[day][rest]=min(a[day]+rec(day+1,0),rec(day+1,rest+1));
        return dp[day][rest];
	}
 
}
 
int main(){
	int n;	cin>>n;