pick a component from the current succession and eliminate it, then, at that point, connect the leftover components together. For instance, on the off chance that you eliminate the 3-rd component from the grouping [4,2,3,1], the subsequent arrangement will be [4,2,1]. You need to eliminate a few components from a to augment f(a), utilizing at least zero activities. Track down the biggest conceivable f(a). Input :The principal
Correct and detailed answer will be upvoted else downvoted.
You can pick a component from the current succession and eliminate it, then, at that point, connect the leftover components together. For instance, on the off chance that you eliminate the 3-rd component from the grouping [4,2,3,1], the subsequent arrangement will be [4,2,1]. You need to eliminate a few components from a to augment f(a), utilizing at least zero activities. Track down the biggest conceivable f(a).
Input :The principal line contains one integer n (1≤n≤2⋅105) — the underlying length of the arrangement. The subsequent line contains n integers a1,a2,… ,an (1≤
Output :Output an integer indicating the biggest f(a) that can be acquired by doing at least zero activities.
Step by step
Solved in 4 steps with 1 images
