Tweet
Tweet

Slide 1

Slide 1 text

Competitive Programming Simon Hørup Eskildsen @Sirupsen Thursday, October 18, 12

Slide 2

Slide 2 text

Thursday, October 18, 12

Slide 3

Slide 3 text

Input Program Output Thursday, October 18, 12

Slide 4

Slide 4 text

Thursday, October 18, 12

Slide 5

Slide 5 text

Thursday, October 18, 12

Slide 6

Slide 6 text

In a sequence of numbers, determine the number of triplets, for which: ai > aj > ak for i < j < k Thursday, October 18, 12

Slide 7

Slide 7 text

5 3 4 2 1 3 2 Thursday, October 18, 12

Slide 8

Slide 8 text

5 3 4 2 1 3 2 0 Thursday, October 18, 12

Slide 9

Slide 9 text

5 3 4 2 1 3 2 1 Thursday, October 18, 12

Slide 10

Slide 10 text

5 3 4 2 1 3 2 2 Thursday, October 18, 12

Slide 11

Slide 11 text

5 3 4 2 1 3 2 2 Thursday, October 18, 12

Slide 12

Slide 12 text

5 3 4 2 1 3 2 3 Thursday, October 18, 12

Slide 13

Slide 13 text

5 3 4 2 1 3 2 4 Thursday, October 18, 12

Slide 14

Slide 14 text

5 3 4 2 1 3 2 5 Thursday, October 18, 12

Slide 15

Slide 15 text

5 3 4 2 1 3 2 6 Thursday, October 18, 12

Slide 16

Slide 16 text

5 3 4 2 1 3 2 7 Thursday, October 18, 12

Slide 17

Slide 17 text

5 3 4 2 1 3 2 8 Thursday, October 18, 12

Slide 18

Slide 18 text

5 3 4 2 1 3 2 8 Thursday, October 18, 12

Slide 19

Slide 19 text

5 3 4 2 1 3 2 8 Thursday, October 18, 12

Slide 20

Slide 20 text

5 3 4 2 1 3 2 8 Thursday, October 18, 12

Slide 21

Slide 21 text

5 3 4 2 1 3 2 8 Thursday, October 18, 12

Slide 22

Slide 22 text

5 3 4 2 1 3 2 9 Thursday, October 18, 12

Slide 23

Slide 23 text

5 3 4 2 1 3 2 9 Thursday, October 18, 12

Slide 24

Slide 24 text

O(N3) Thursday, October 18, 12

Slide 25

Slide 25 text

5 3 4 2 1 3 2 Thursday, October 18, 12

Slide 26

Slide 26 text

5 3 4 2 1 3 2 Thursday, October 18, 12

Slide 27

Slide 27 text

5 3 4 2 1 3 2 Thursday, October 18, 12

Slide 28

Slide 28 text

5 3 4 2 1 3 2 0 Thursday, October 18, 12

Slide 29

Slide 29 text

5 3 4 2 1 3 2 1 Thursday, October 18, 12

Slide 30

Slide 30 text

5 3 4 2 1 3 2 1 Thursday, October 18, 12

Slide 31

Slide 31 text

5 3 4 2 1 3 2 2 Thursday, October 18, 12

Slide 32

Slide 32 text

5 3 4 2 1 3 2 6 Thursday, October 18, 12

Slide 33

Slide 33 text

5 3 4 2 1 3 2 9 Thursday, October 18, 12

Slide 34

Slide 34 text

5 3 4 2 1 3 2 15 Thursday, October 18, 12

Slide 35

Slide 35 text

O(N•log(n)) Thursday, October 18, 12

Slide 36

Slide 36 text

5 3 4 2 1 3 2 0 Thursday, October 18, 12

Slide 37

Slide 37 text

5 3 4 2 1 3 2 0 0 Thursday, October 18, 12

Slide 38

Slide 38 text

5 3 4 2 1 3 2 0 0 1 Thursday, October 18, 12

Slide 39

Slide 39 text

5 3 4 2 1 3 2 0 0 1 0 Thursday, October 18, 12

Slide 40

Slide 40 text

5 3 4 2 1 3 2 0 0 1 0 1 Thursday, October 18, 12

Slide 41

Slide 41 text

5 3 4 2 1 3 2 2 0 1 0 1 4 Thursday, October 18, 12

Slide 42

Slide 42 text

5 3 4 2 1 3 2 3 0 1 0 1 4 3 Thursday, October 18, 12

Slide 43

Slide 43 text

5 3 4 2 1 3 2 12 0 1 0 1 4 3 6 Thursday, October 18, 12

Slide 44

Slide 44 text

O(N•log(n)) Thursday, October 18, 12

Slide 45

Slide 45 text

Crocodile Thursday, October 18, 12

Slide 46

Slide 46 text

Thursday, October 18, 12

Slide 47

Slide 47 text

Algorithms Web developer Thursday, October 18, 12

Slide 48

Slide 48 text

? @Sirupsen Thursday, October 18, 12