OJ Board

I am using the O( n log n) DP algorithm but I'm not sure about the space usage. The problem must be how I'm storing the intermediate LIS. I'm using pair<int, vector<int> > *L; The vector<int> must be the problem but I don't know how else to do it. I could change it to an array but I don't think that ...

i did not know that. every other problem i have read that is multi-input has said it in the problem description and has demonstrated it in the sample input.

im trying to solve 481 and i believe my program works except i keep getting memory limit exceeded and dont see why. ive tried cutting the memory down changing vectors to arrays because that is the only thing i could thing of. i also changed the binary search to use a stack instead of recursive calls ...

blue tick?

i was having trouble with 545 so i started searching the forums and found out that it was multiple input but it says nothing about that in the problem and the input sample is not in the format of a multiple input.

where does it say this problem is multiple input?

http://acm.uva.es/p/v5/545.html ...

i think ive found a problem with stringstreams in what ever compiler the judge uses.

here is an accepted solution for 120

[cpp]
#include<cstdio>
#include <iostream>
#include<cstdlib>
#include <memory.h>
#include <algorithm>
#include <sstream>
#include <string>

using namespace std;

int panc[30 ...