Malay Keshav

Download Resume PDF

Malay Keshav

Netaji Subhas Institute of Technology

Posts Categorized / ACM ICPC

ACM ICPC Amritapuri 2013 – Problem C (Ganga Fort) – Solution

December 29, 2013 | ACM ICPC, All, C++, Editorial | by malay.keshav

The problem was simple and could be solved using a sliding window of size K. Although the number of corner cases made it difficult to get the solution Accepted. As a result our team could not complete it during the onsite ACM ICPC Amritapuri 2013 regionals. To begin solving this problem, create the following structure […]

ACM ICPC Amritapuri 2013 – Problem B (Sorted Queues) – Solution

December 29, 2013 | ACM ICPC, All, Editorial | by malay.keshav

This invloved using Linear Dynamic Programming. The subproblem was to divide the Single queue into multiple independent queues and solve for them individually. Let the two queues be A[N] and B[N]. The queue is separated at critical points. These critical points are those indexes i where the following the condition is satisfied : (b[i] > […]