Rust One liner
Intuition\nThe problem is about maximizing the score over a series of k days, with n cities. Each day, we can either stay in the same city or travel to another 
# Intuition\nThe problem is about maximizing the score over a series of k days, with n cities. Each day, we can either stay in the same city or travel to another city. The goal is to maximize the score based on the given stay_score and travel_score matrices.\n\nWe are given the scores for staying in a city and traveling between cities. The decision for each day is whether to stay or travel, and we want to track the maximum possible score as we progress through the days.\n\n# Complexity\n- Time complexity: O(k\xD7n<sup>2</sup>)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(k\xD7n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```rust []\nimpl Solution {\n    pub fn max_score(n: i32, k: i32, stay_score: Vec<Vec<i32>>, travel_score: Vec<Vec<i32>>) -> i32 {\n        let k = k as usize;\n        let n = n as usize;\n        \n        let mut dp = vec![vec![0; n]; k + 1];\n        \n        for i in 1..=k {\n            for a in 0..n {\n                for b in 0..n {\n                    if a == b {\n                        dp[i][a] = dp[i][a].max(dp[i - 1][b] + stay_score[i - 1][b]);\n                    } else {\n                        dp[i][a] = dp[i][a].max(dp[i - 1][b] + travel_score[b][a]);\n                    }\n                }\n            }\n        }\n\n        let mut ans = 0;\n        for &num in &dp[k] {\n            ans = ans.max(num);\n        }\n\n        ans\n    }\n}\n\n```
[]