diff options
author | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
---|---|---|
committer | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
commit | d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch) | |
tree | 96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /best_team_no_conflict.cpp | |
download | leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip |
initial
Diffstat (limited to 'best_team_no_conflict.cpp')
-rw-r--r-- | best_team_no_conflict.cpp | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/best_team_no_conflict.cpp b/best_team_no_conflict.cpp new file mode 100644 index 0000000..0773202 --- /dev/null +++ b/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); +} |