aboutsummaryrefslogtreecommitdiff
path: root/max_score_node_sequence.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'max_score_node_sequence.cpp')
-rw-r--r--max_score_node_sequence.cpp43
1 files changed, 0 insertions, 43 deletions
diff --git a/max_score_node_sequence.cpp b/max_score_node_sequence.cpp
deleted file mode 100644
index b4df5d5..0000000
--- a/max_score_node_sequence.cpp
+++ /dev/null
@@ -1,43 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- int maximumScore(vector<int> &scores, vector<vector<int>> &edges) {
- const int n = scores.size();
- vector<vector<int>> adj(n);
- for (const vector<int> &edge : edges) {
- adj[edge[0]].push_back(edge[1]);
- adj[edge[1]].push_back(edge[0]);
- }
- for (vector<int> &a : adj) {
- priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pqpvg;
- for (int v : a) {
- int score = scores[v];
- if (pqpvg.size() < 3 || pqpvg.top().first < score) {
- pqpvg.push({score, v});
- if (pqpvg.size() > 3)
- pqpvg.pop();
- }
- }
- a.resize(pqpvg.size());
- for (int i = a.size() - 1; i >= 0; --i) {
- a[i] = pqpvg.top().second;
- pqpvg.pop();
- }
- }
- int ans = -1;
- for (const vector<int> &edge : edges) {
- int u = edge[0], v = edge[1], base = scores[u] + scores[v];
- for (int x : adj[u]) {
- if (x == v)
- continue;
- for (int y : adj[v]) {
- if (y == u || x == y)
- continue;
- ans = max(ans, base + scores[x] + scores[y]);
- }
- }
- }
- return ans;
- }
-};