Codility Lesson 5
-
Lesson 5 Prefix Sums MinVagTwoSlice 나만의 풀이알고리즘/codility 2021. 6. 4. 23:53
문제 A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P < Q < N, is called a slice of array A (notice that the slice contains at least two elements). The average of a slice (P, Q) is the sum of A[P] + A[P + 1] + ... + A[Q] divided by the length of the slice. To be precise, the average equals (A[P] + A[P + 1] + ... + A[Q]) / (Q − P + 1). For example, a..
-
Lesson 5 Prefix Sums PassingCars 나만의 풀이알고리즘/codility 2021. 6. 2. 12:39
문제 A non-empty array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road. Array A contains only 0s and/or 1s: 0 represents a car traveling east,1 represents a car traveling west. The goal is to count passing cars. We say that a pair of cars (P, Q), where 0 ≤ P < Q < N, is passing when P is traveling to the east and Q is traveling to the w..