()
| 55 | } |
| 56 | |
| 57 | public static int compute() { |
| 58 | dp[0] = arr[0]; |
| 59 | l = r = 0; |
| 60 | for (int i = 1; i <= n; i++) { |
| 61 | add(i - a); |
| 62 | overdue(i - b - 1); |
| 63 | dp[i] = l < r ? dp[queue[l]] + arr[i] : NA; |
| 64 | } |
| 65 | int ans = NA; |
| 66 | for (int i = n + 1 - b; i <= n; i++) { |
| 67 | ans = Math.max(ans, dp[i]); |
| 68 | } |
| 69 | return ans; |
| 70 | } |
| 71 | |
| 72 | public static void add(int j) { |
| 73 | if (j >= 0 && dp[j] != NA) { |