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
|
struct Solution;
impl Solution {
pub fn job_scheduling(start_time: Vec<i32>, end_time: Vec<i32>, profit: Vec<i32>) -> i32 {
let mut jobs: Vec<usize> = (0..profit.len()).collect();
jobs.sort_unstable_by_key(|&i| end_time[i]);
let mut dp: Vec<(i32, i32)> = vec![(0, i32::MIN)];
for &i in jobs.iter() {
let left = match dp.binary_search_by_key(&start_time[i], |&(_, t)| t) {
Ok(j) => j,
Err(j) => j - 1
};
if dp[left].0 + profit[i] > dp.last().unwrap().0 {
if end_time[i] == dp.last().unwrap().1 {
dp.last_mut().unwrap().0 = dp[left].0 + profit[i];
} else {
dp.push((dp[left].0 + profit[i], end_time[i]));
}
}
}
dp.last().unwrap().0
}
}
fn main() {
let start_time = vec![1,2,3,3];
let end_time = vec![3,4,5,6];
let profit = vec![50,10,40,70];
print!("{}", Solution::job_scheduling(start_time, end_time, profit)); //120
}
|