码迷,mamicode.com
首页 > 其他好文 > 详细

1626. Best Team With No Conflicts

时间:2021-04-10 13:19:16      阅读:0      评论:0      收藏:0      [点我收藏+]

标签:sum   possible   wan   date   and   team   ssi   tween   manager   

You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all the players in the team.

However, the basketball team is not allowed to have conflicts. A conflict exists if a younger player has a strictly higher score than an older player. A conflict does not occur between players of the same age.

Given two lists, scores and ages, where each scores[i] and ages[i] represents the score and age of the ith player, respectively, return the highest overall score of all possible basketball teams.

 

Example 1:

Input: scores = [1,3,5,10,15], ages = [1,2,3,4,5]
Output: 34
Explanation: You can choose all the players.

Example 2:

Input: scores = [4,5,6,5], ages = [2,1,2,1]
Output: 16
Explanation: It is best to choose the last 3 players. Notice that you are allowed to choose multiple people of the same age.

Example 3:

Input: scores = [1,2,3,5], ages = [8,9,10,1]
Output: 6
Explanation: It is best to choose the first 3 players. 

 1 class Solution {
 2     public int bestTeamScore(int[] scores, int[] ages) {
 3        int n = ages.length;
 4        int[][] candidate = new int[n][2];
 5        
 6        for(int i=0; i<n; i++) {
 7            candidate[i][0] = ages[i];
 8            candidate[i][1] = scores[i];
 9        }
10        Arrays.sort(candidate, (a,b) -> a[0] == b[0] ? a[1]-b[1] : a[0]-b[0]);
11        int[] dp = new int[n];
12        dp[0] = candidate[0][1];
13        int max = dp[0];
14        for(int i=1; i<n; i++) {
15            dp[i] = candidate[i][1];
16            for(int j=0; j<i; j++) {
17                if(candidate[j][1] <= candidate[i][1]) {
18                    dp[i] = Math.max(dp[i], candidate[i][1]+dp[j]);
19                }  
20            }
21            max = Math.max(dp[i], max);
22        }
23        return max;
24    }
25 }

 

1626. Best Team With No Conflicts

标签:sum   possible   wan   date   and   team   ssi   tween   manager   

原文地址:https://www.cnblogs.com/beiyeqingteng/p/14638923.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!