Using DP in 1Count

Kapil-Israni-2501896056550976 · August 25, 2019, 5:42am

How will we be doing it using dp. Like what should be the recursion and return value . I really get confused when i have to think of memoization.

apaarkamal · August 25, 2019, 7:37am

see this , it is actually two pointers

github.com

apaarkamal/launchpad_summer_2k19/blob/master/24. doubts class with extra topics/1 count .cpp

#include<bits/stdc++.h>

using namespace std;

#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int,int>
#define pb push_back

const int N=100005;

int32_t main()
{
    ios_base:: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    // int t;cin>>t;while(t--)
    {
        int i,j,k,n,m,ans=0,cnt=0,sum=0;

This file has been truncated. show original

apaarkamal · November 5, 2019, 7:14am

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.