We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 832777d commit 276c497Copy full SHA for 276c497
solution/2008/sol1.cpp
@@ -0,0 +1,22 @@
1
+class Solution {
2
+public:
3
+ long long maxTaxiEarnings(int n, vector<vector<int>>& rides) {
4
+ int mx = 0;
5
+ for (auto& ride: rides) {
6
+ mx = max(mx, ride[1]);
7
+ }
8
+ vector<long long> dp(mx + 1, 0);
9
+ vector<vector<pair<int, int>>> ed(mx + 1);
10
11
+ int s = ride[0], e = ride[1], tip = ride[2];
12
+ ed[e].push_back({ s, e - s + tip });
13
14
+ for (int i = 1; i <= mx; ++i) {
15
+ dp[i] = dp[i - 1];
16
+ for (auto& [s, fee]: ed[i]) {
17
+ dp[i] = max(dp[i], dp[s] + fee);
18
19
20
+ return dp[mx];
21
22
+};
0 commit comments