OJ Board

What's the catch with problem 120? Here's my code:

[cpp]#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iterator>
using namespace std;

void solve(vector<int>& stack, int start) {
if(start==stack.size()) return;

int minpos = start;
for(int c = start; c ...

The code works flawlessly on the given examples. Any ideas?

[cpp] #include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <string>
using namespace std;

typedef vector< list<int> > blocktype;

void printblocks(blocktype b, vector<int> i) {
int c=0;
for(blocktype ...

My code for problem 105 works fine for all tests I've done, but still gets WA by the Judge. Are there any evil special cases I might have missed?

May the data contain buildings with leftcoordinade == rightcoordinate?