2025-07-10 14:13:01 +08:00
|
|
|
struct Solution;
|
|
|
|
impl Solution {
|
2025-07-26 23:49:26 +08:00
|
|
|
pub fn max_subarrays(n: i32, mut conflicting_pairs: Vec<Vec<i32>>) -> i64 {
|
|
|
|
let mut arr: Vec<Vec<i32>> = vec![vec![]; (n + 1) as usize];
|
|
|
|
for pair in conflicting_pairs.iter_mut() {
|
|
|
|
if pair[0] > pair[1] {
|
|
|
|
pair.swap(0, 1);
|
2025-07-22 21:59:38 +08:00
|
|
|
}
|
2025-07-26 23:49:26 +08:00
|
|
|
arr[pair[0] as usize].push(pair[1]);
|
|
|
|
}
|
|
|
|
let mut ans: i64 = 0;
|
|
|
|
let mut extra: Vec<i64> = vec![0; (n + 2) as usize];
|
|
|
|
let mut b: Vec<i64> = vec![(n + 1) as i64; (n + 1) as usize];
|
|
|
|
for i in (1..=n as usize).rev() {
|
|
|
|
b.extend(arr[i].iter().map(|&x| x as i64));
|
|
|
|
b.sort_unstable();
|
|
|
|
b.truncate(2);
|
|
|
|
|
|
|
|
ans += (b[0] as i64) - (i as i64);
|
|
|
|
extra[b[0] as usize] += b[1] - b[0];
|
2025-07-10 14:13:01 +08:00
|
|
|
}
|
2025-07-26 23:49:26 +08:00
|
|
|
ans + *extra.iter().max().unwrap() as i64
|
2025-07-10 14:13:01 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn main() {
|
2025-07-26 23:49:26 +08:00
|
|
|
let sl = Solution::max_subarrays(5, vec![vec![1, 2], vec![2, 5], vec![3, 5]]);
|
2025-07-10 14:13:01 +08:00
|
|
|
println!("{}", sl);
|
|
|
|
}
|
2025-07-26 23:49:26 +08:00
|
|
|
|