Count Subarrays

CodeChefOpen on judge ↗

Given an array of N integers A1, A2 ... AN and an integer K, count number of subarrays of A such that number of inversions in those subarrays is at least K. Inversions in a subarray Ai, Ai+1 ... Aj is defined as number of pairs (a,b) such that i ≤ a and Aa > Ab. Input First line consists of N and K in single line. Next line contains N space separated integers denoting array A. Output Print

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