OJ Board

Same happening to me

fabiofabris wrote:I finally made it!!!

Some considerations about this problem:
- X 0001 should print 1
- X 0000 should print 0
that you are printing a blank column BETWEEN digits.

I think this input is kinnda trick...

This helped me to get ac

7 WA before AC . The very last thing I fixed was I had assumed incorrectly that 'X' would be the last input, ie if 'X' was inputted there wouldn't be anything after it, but that was wrong. hope that helps someone

I had no idea this existed

http://en.wikipedia.org/wiki/Longest_increasing_subsequence
I understand how the algorithm works with integer values that are either greater or lesser than other values. I don't see how that algorithm works with boxes that can't nest inside others.

for example with integers { 3 , 6 , 1 , 2 , 5 , 4 ...

import java.util.*;

class Main {

public static void main(String[] args){
new Main().solveProblem();
}

public void solveProblem(){
final Scanner in = new Scanner(System.in);
while(in.hasNextInt()){
int i = in.nextInt();
int j = in.nextInt();
int[] values = new int[j-i+1];
for(int k = i ...