Blocks

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

//package javaapplication12;

import java.util.ArrayList;
import java.util.Stack;

/**
 *
 * @author tuukkatu
 */
public class JavaApplication12 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        IO io = new IO();
	
	//String a = io.next(); // Lukee seuraavan välein erotellun merkkijonon.
	//int b = io.nextInt(); // Lukee seuraavan välein erotellun int-kokonaisluvun.
	//long c = io.nextLong(); // Lukee seuraavan välein erotellun long-kokonaisluvun.
	//double d = io.nextDouble(); // Lukee seuraavan välein erotellun double-liukuluvun.
	
        int n = io.nextInt();

        ArrayList<Stack> towers = new ArrayList();

        towers.add(new Stack());
        
        int[] blocks = new int[n];
        
        towers.get(0).add(io.nextInt());
        
        for (int i = 0; i < n - 1; i++) {
            int block = io.nextInt();
            
            int smallestDifference = Integer.MAX_VALUE;
            
            int indexOfSmallest = -1;

            boolean blockFits = false;
            
            for (Stack tower : towers) {
                int top = (int) tower.peek();
                
                int difference = top - block;
                
                if (difference >= 0) {
                    blockFits = true;
                    if (difference < smallestDifference) {
                        indexOfSmallest = towers.indexOf(tower);
                        smallestDifference = difference;
                    }
                }   
            }
            
            if (blockFits) {
                towers.get(indexOfSmallest).add(block);
            } else {
                Stack newTower = new Stack();
                newTower.add(block);
                towers.add(newTower);
            }
           
            //blocks[i] = input;
        }
        
        int numOfTowers = towers.size();
        
        io.println(numOfTowers);
        
	io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta
        
    }
    
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED