it was
it is
idea for E1 and E2
how to recalculate inversions for permutation with increased length
huge number of WA and TL was get because of commenting (and not commenting also) this string
  1. While you query minimum on range [tin[v], ∞) in tree ‘mn’ and find vertex u with tout[u] ≤ tout[v], delete it from ‘mn’. If at least one u was found — put p[v] in ‘mn’
presentation of some sequence of updates
adding extra edges to get possibility to use mincost-maxflow algo




competitive programmer

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Reinforcing and Strengthening IT Project Management to Maximize Efficiency

Cloud Monitoring Spend Is Worth Spending

Myth Busting: I Need To Learn A Programming Language To Create An Eye Website

5 best docker services can help you

Introduction to Docker- A step by step guide to learn docker: Part 2

Weekly Contest 274 Q4 | 2127. Maximum Employees to Be Invited to a Meeting | Hard

Caching with Kotlin Coroutines

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Vladislav Remidovskiy

Vladislav Remidovskiy

competitive programmer

More from Medium

Mitacs Selection Experience

How my job application led to a call in 48 hours

How AI and Machine Learning are Evolving DevOps? | clay19999

Merkle Sokrati interview experience