Mr. Felix Halim has a great collection and classification about these types of problems.
Go to http://felix-halim.net/uva/hunting.php
, put your uva username in the box and go ahead, it will show your statistics, now on the right side of "Competitive Programming Exercises" section, you will see two labels:
"2. Data Structures and Libraries"
You can click on them to expand and you will find what you want from uva.
For other judges like SPOJ [ http://www.spoj.pl/
] there is not much resource about their problems around.
You can also use TopCoder [ http://www.topcoder.com/tc
] and check problems from past srms.
As far as I know, these problems can be called ad-hoc (no specific algorithm needed).