Homer preferences exhibits a great deal. Today he is painting a cluster a1,a2,… ,a with two sorts of tones, white and dark. A work of art task for a1,a2,… ,an is depicted by a cluster b1,b2,… ,bn that bi shows the shade of simulated intelligence (0 for white and 1 for dark). As indicated by an artwork task b1,b2,… ,bn, the exhibit an is parted into two new clusters a(0
Correct answer will be upvoted else downvoted. Computer science.
Homer preferences exhibits a great deal. Today he is painting a cluster a1,a2,… ,a with two sorts of tones, white and dark. A work of art task for a1,a2,… ,an is depicted by a cluster b1,b2,… ,bn that bi shows the shade of simulated intelligence (0 for white and 1 for dark).
As indicated by an artwork task b1,b2,… ,bn, the exhibit an is parted into two new clusters a(0) and a(1), where a(0) is the sub-succession of all white components in an and a(1) is the sub-arrangement of all dark components in a. For instance, assuming a=[1,2,3,4,5,6] and b=[0,1,0,1,0,0], a(0)=[1,3,5,6] and a(1)=[2,4].
The number of portions in a cluster c1,c2,… ,ck, indicated seg(c), is the number of components if we consolidate all neighboring components with a similar worth in c. For instance, the number of portions in [1,1,2,2,3,3,3,2] is 4, in light of the fact that the exhibit will become [1,2,3,2] in the wake of combining contiguous components with a similar worth. Particularly, the number of sections in an unfilled cluster is 0.
Homer needs to find an artwork task b, as indicated by which the number of sections in both a(0) and a(1), for example seg(a(0))+seg(a(1)), is just about as extensive as could be expected. Track down this number.
Input
The main line contains an integer n (1≤n≤105).
The subsequent line contains n integers a1,a2,… ,an (1≤
Output
Output a solitary integer, showing the maximal conceivable complete number of portions.
Step by step
Solved in 4 steps with 1 images
