evasean

摘要： 题目原文： An inversion in an array a[] is a pair of entries a[i] and a[j] such that i<j but a[i]>a[j]. Given an array, design a linearithmic algorithm to 阅读全文

摘要： 题目原文： Stack with max. Create a data structure that efficiently supports the stack operations (push and pop) and also a return-the-maximum operation. A 阅读全文