Fill in the order form to get the price

Subject

Category

Deadline

Timezone:

Title *

Task *

{"ops":[{"insert":"Bhaskar found an array A of size n and wants to find a subsequence of the array which is good.\nA subsequence is a sequence that can be derived from the given array by deleting zero or more elements without changing the relative order of the remaining elements.\n\nA good subsequence meets following:\nThe length of the subsequence is even.\nlet the subsequence be B of size t, where t is even, So let the function f[i] = B[2*i] + B[2*i + 1] for all i from 0 to t2\u22121 both inclusive. Please note that indexing is zero-based here. So Sotwik wants all the f[i] to be same. In other words f[0] = f[1] = ... = f[t2\u22121] should hold.\n\nAs Bhaskar wants to utilize the whole array and delete as fewer elements as possible. He needs your help in finding the minimum number of elements that are required to be deleted such that the remaining subsequence is a good subsequence.\n\nInput\nn is the size of array. Second line has elements of array A of size n.\n\nOutput\nPrint a single integer denoting the minimum number of deletions required.\n"}]}

I need basic explanations

Special Requirements

Upload files (if required)

Drop files here to upload

Add files...

Account info

Already have an account?

Name *

E-mail *

Password *

The password must be at least 6 characters.

I agree with terms & conditions