<p>Given a binary array <code>nums</code>, you should delete one element from it.</p>

<p>Return <em>the size of the longest non-empty subarray containing only </em><code>1</code><em>&#39;s in the resulting array</em>. Return <code>0</code> if there is no such subarray.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,0,1]
<strong>Output:</strong> 3
<strong>Explanation:</strong> After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1&#39;s.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1,1,1,0,1,1,0,1]
<strong>Output:</strong> 5
<strong>Explanation:</strong> After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1&#39;s is [1,1,1,1,1].
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> You must delete one element.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>

class Solution {
public:
    int n;
    int dp[100001][2];
    int dfs(vector<int>& nums,int curr,int par){
        if(curr>=n){
            if(par==1){
                return -1;
            }
            return 0;
        }
        if(dp[curr][par]!=-1){
            return dp[curr][par];
        }

        if(nums[curr]==0 && par>0){
            return dp[curr][par]=dfs(nums,curr+1,par-1);
        }
        else if(nums[curr]==0 && par==0){
            return dp[curr][par]=0;
        }
        else{
            return dp[curr][par]=1+dfs(nums,curr+1,par);
        }

    }
    int longestSubarray(vector<int>& nums) {
        n=nums.size();
        int ans=INT_MIN;
        memset(dp,-1,sizeof(dp));
        for(int i=0;i<n;i++){
            ans=max(ans,dfs(nums,i,1));
        }

        return ans;
    }
};
60800