#include <bits/stdc++.h> #define ndl '\n' #define ll long long #define st first #define nd second #define debug(x) cout << #x << ": " << x << ndl #define all(x) (x).begin(), (x).end() using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin>>n>>m; vector<pair<ll, ll>> t(n); for(auto &[a, b]:t) cin>>a>>b; unordered_map<int, int> last_color; vector<ll> dp_lvl; vector<ll> dp(n); for(int i=0;i<n;i++) { if(i == 0 || t[i-1].first != t[i].first) { dp_lvl.push_back(0); if(i > 0) { dp_lvl.back() = max(dp_lvl.back(), dp_lvl[dp_lvl.size()-2]); } } dp[i] = max(dp[i], t[i].first); if(dp_lvl.size() > 1) { dp[i] = max(dp[i], dp_lvl[dp_lvl.size()-2] + t[i].first - m); } if(last_color.count(t[i].second) > 0) { if(t[last_color[t[i].second]].first != t[i].first) { dp[i] = max(dp[i], dp[last_color[t[i].second]] + t[i].first); } else { dp[i] = max(dp[i], dp[last_color[t[i].second]]); } } last_color[t[i].second] = i; dp_lvl.back() = max(dp_lvl.back(), dp[i]); } ll maxi = 0; for(auto x:dp) { maxi = max(maxi, x); } // for(auto x:dp) { // cout<<x<<" "; // } // cout<<"\n"; cout<<maxi<<'\n'; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 | #include <bits/stdc++.h> #define ndl '\n' #define ll long long #define st first #define nd second #define debug(x) cout << #x << ": " << x << ndl #define all(x) (x).begin(), (x).end() using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m; cin>>n>>m; vector<pair<ll, ll>> t(n); for(auto &[a, b]:t) cin>>a>>b; unordered_map<int, int> last_color; vector<ll> dp_lvl; vector<ll> dp(n); for(int i=0;i<n;i++) { if(i == 0 || t[i-1].first != t[i].first) { dp_lvl.push_back(0); if(i > 0) { dp_lvl.back() = max(dp_lvl.back(), dp_lvl[dp_lvl.size()-2]); } } dp[i] = max(dp[i], t[i].first); if(dp_lvl.size() > 1) { dp[i] = max(dp[i], dp_lvl[dp_lvl.size()-2] + t[i].first - m); } if(last_color.count(t[i].second) > 0) { if(t[last_color[t[i].second]].first != t[i].first) { dp[i] = max(dp[i], dp[last_color[t[i].second]] + t[i].first); } else { dp[i] = max(dp[i], dp[last_color[t[i].second]]); } } last_color[t[i].second] = i; dp_lvl.back() = max(dp_lvl.back(), dp[i]); } ll maxi = 0; for(auto x:dp) { maxi = max(maxi, x); } // for(auto x:dp) { // cout<<x<<" "; // } // cout<<"\n"; cout<<maxi<<'\n'; return 0; } |