sdfdsf

1. 1 2 3 4
1 1
2 3
3 3
4 5
5 7
6
7
8
날짜
작업개수
[1, 3, 2, 5, 7, 2, 4, 8]
jobDifficulty

2. 1 2 3 4
1 1
2 3 4
3 3
4 5
5 7
6
7
8
날짜
작업개수
[1, 3, 2, 5, 7, 2, 4, 8]
jobDifficulty
𝐹(2,2) = 𝑚𝑖𝑛(𝑑𝑖𝑓𝑓(1,2) + 𝐹(1,1))
= 3 + 1 = 4

3. 1 2 3 4
1 1
2 3 4
3 3 4
4 5
5 7
6
7
8
날짜
작업개수
[1, 3, 2, 5, 7, 2, 4, 8]
jobDifficulty
𝐹(2,3) = 𝑚𝑖𝑛(𝑑𝑖𝑓𝑓(2,3) + 𝐹(1,1),
= 𝑚𝑖𝑛(2 + 3,
𝑑𝑖𝑓𝑓(1,3) + 𝐹(1,2))
3 + 1) = 4

4. 1 2 3 4
1 1
2 3 4
3 3 4
4 5 6
5 7
6
7
8
날짜
작업개수
[1, 3, 2, 5, 7, 2, 4, 8]
jobDifficulty
𝐹(2,4) = 𝑚𝑖𝑛(𝑑𝑖𝑓𝑓(3,4) + 𝐹(1,3),
= 𝑚𝑖𝑛(5 + 3,
𝑑𝑖𝑓𝑓(2,4) + 𝐹(1,2))
5 + 1) = 6
𝑑𝑖𝑓𝑓(1,4) + 𝐹(1,1))
5 + 3,

5. 1 2 3 4
1 1
2 3 4
3 3 4
4 5 6
5 7 8
6 8
7
8
날짜
작업개수
[1, 3, 2, 5, 7, 2, 4, 8]
jobDifficulty
𝐹(2,6) = 𝑚𝑖𝑛(𝑑𝑖𝑓𝑓(5,6) + 𝐹(1,5), . . . )

6. 1 2 3 4
1 1
2 3 4
3 3 4 6
4 5 6 9 11
5 7 8 11 13
6 8 10 13
7 12 13
8 14
날짜
작업개수
[1, 3, 2, 5, 7, 2, 4, 8]
jobDifficulty
𝐹(4,8) = 14