-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathassignment.go
79 lines (60 loc) · 1.19 KB
/
assignment.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
package main
import (
"fmt"
"math"
)
//get subset of array
func copy1(a []int, start int, stop int) []int {
dest := make([]int, stop-start)
var flag int = 0
for i := start; i < stop; i++ {
dest[flag] = a[i]
flag++
}
//fmt.Println(flag)
return dest[:]
}
func main() {
a := []int{0, 0, 0}
//copy1 := append(copy1, A...)
q := 2
values := [][]int{}
for i := 1; i <= q; i++ {
fmt.Printf("Enter the elements for %v query ", i)
var temp [3]int
for j := 0; j < 3; j++ {
fmt.Scanf("%d", &temp[j])
}
values = append(values, temp[:])
}
results := make([]int, q)
index := 0
for i := 0; i < 2; i++ {
if values[i][0] == 1 {
A := copy1(a, values[i][1], values[i][2])
size := len(A)
for j := 0; j < size; j++ {
if j == 0 {
A[j] = 1 + A[j]
} else {
A[j] = 1 + int(math.Max(float64(A[j]), float64(A[j-1])))
}
}
results[index] = A[size-1]
index++
} else {
A := copy1(a, values[i][1], values[i][2])
size := len(A)
for j := 0; j < size; j++ {
if j == 0 {
A[j] = 1 + A[j]
} else {
A[j] = 1 + int(math.Min(float64(A[j]), float64(A[j-1])))
}
}
results[index] = A[size-1]
index++
}
}
fmt.Print(results)
}