Ravi Plan

CodeChefOpen on judge ↗

Ravi is planning to plant a bomb in the city. City is organized in such a way that only similar continuous blocks gets affected by such attacks. Ravi have the information of the arrangement of blocks. Help him to calculate maximum number of blocks that can be destroyed. INPUT First line of input contains N denoting number of blocks. Then for following N space separated number denotes type of b

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI