aboutsummaryrefslogtreecommitdiff
path: root/other/best_team_no_conflict.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/best_team_no_conflict.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directoryHEADmaster
Diffstat (limited to 'other/best_team_no_conflict.cpp')
-rw-r--r--other/best_team_no_conflict.cpp28
1 files changed, 28 insertions, 0 deletions
diff --git a/other/best_team_no_conflict.cpp b/other/best_team_no_conflict.cpp
new file mode 100644
index 0000000..0773202
--- /dev/null
+++ b/other/best_team_no_conflict.cpp
@@ -0,0 +1,28 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ int bestTeamScore(vector<int> &scores, vector<int> &ages) {
+ int n = scores.size(), ans = 0;
+ vector<int> dp(n, 0);
+ vector<pair<int, int>> arr(n, {0, 0});
+ for (int i = 0; i < n; ++i) {
+ arr[i].first = ages[i];
+ arr[i].second = scores[i];
+ }
+ for (int i = 0; i < n; ++i) {
+ dp[i] = arr[i].second;
+ for (int j = i - 1; j >= 0; --j)
+ if (arr[i].second >= arr[j].second)
+ dp[i] = max(dp[i], dp[j] + arr[i].second);
+ ans = max(ans, dp[i]);
+ }
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> scores = {1, 3, 5, 10, 15}, ages = {1, 2, 3, 4, 5};
+ cout << obj.bestTeamScore(scores, ages);
+}