Deletion and Append O(N), Access O(1), that is an array.

You can improve the first two to O(logN) by making access more expensive. For any kind of item. I know that.

What I want, is to make the first two cheaper, but keeping access at O(1), by abusing the fact that I only need delete/append (and not insert). and the values are increasing. If it's possible...