Advertisement
tepyotin2

KM-Bucket List

Dec 30th, 2023
119
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.70 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. bool isDiag = false;
  6. int ti[1001];
  7. int pref[1001];
  8.  
  9. int main(){
  10.    
  11.     //isDiag = true;
  12.     freopen("blist.in", "r", stdin);
  13.    
  14.     int N;
  15.     cin >> N;
  16.    
  17.     int maxT = 0;
  18.     for (int i = 0; i < N; i++)
  19.     {
  20.         int s, t, b;
  21.         cin >> s >> t >> b;
  22.         if(isDiag) cout << "s: " << s << ", t: " << t << ", b: " << b << endl;
  23.         ti[s] = ti[s] + b;
  24.         ti[t] = ti[t] - b;
  25.         maxT = max(maxT, t);
  26.     }
  27.    
  28.     int ans = 0;
  29.     for (int i = 1; i <= maxT; i++)
  30.     {
  31.         pref[i] =  pref[i-1] + ti[i];
  32.        
  33.         ans = max(ans, pref[i]);
  34.         if(isDiag) cout << "pref[" <<  i  << "] = " << pref[i] << endl;
  35.     }
  36.    
  37.     if(!isDiag) freopen("blist.out", "w", stdout);;
  38.     cout << ans << endl;
  39.    
  40.    
  41. }
  42.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement