fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency1(int n){
  33.  
  34.     vector<int> pMaxi(n+1, 0);
  35.     for(int i=0; i<n; i++){
  36.         pMaxi[i+1] = max(pMaxi[i], a[i]);
  37.     }
  38.  
  39.     vector<int> sMaxi(n+1, 0);
  40.     for(int i=n-1; i>=0; i--){
  41.         sMaxi[i] = max(sMaxi[i+1], a[i]);
  42.     }
  43.  
  44.  
  45.     int ans = 0;
  46.     for(int i=0; i<n; i++){
  47.         int h = min(pMaxi[i], sMaxi[i+1]);
  48.         if(h > a[i]) ans += h-a[i];
  49.     }
  50.  
  51.  
  52.     return ans;
  53. }
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62. int consistency2(int n){
  63.  
  64.     int ans = 0;    
  65.     int s = 0, e = n-1;
  66.  
  67.     int leftMaxi = 0;
  68.     int rightMaxi = 0;  
  69.  
  70.     while(s<e){
  71.         leftMaxi = max(leftMaxi, a[s]);
  72.         rightMaxi = max(rightMaxi, a[e]);   
  73.         if(a[s] < a[e]){
  74.             ans += min(leftMaxi, rightMaxi) - a[s];
  75.             s++;
  76.         }
  77.         else{
  78.             ans += min(leftMaxi, rightMaxi) - a[e];
  79.             e--;
  80.         }
  81.     }
  82.  
  83.  
  84.     return ans;
  85. }
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95.  
  96.  
  97. int practice(int n){
  98.  
  99.  
  100.     return 0;
  101. }
  102.  
  103.  
  104.  
  105.  
  106.  
  107. void solve() {
  108.  
  109.     int n;
  110.     cin>> n;
  111.  
  112.     a.resize(n);
  113.     for(int i=0; i<n; i++) cin >> a[i];
  114.  
  115.     cout << consistency1(n) << " " << consistency2(n) << endl;
  116.  
  117.  
  118. }
  119.  
  120.  
  121.  
  122.  
  123.  
  124. int32_t main() {
  125.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  126.  
  127.     int t = 1;
  128.     // cin >> t;
  129.     while (t--) {
  130.         solve();
  131.     }
  132.  
  133.     return 0;
  134. }
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
6
4 2 0 3 2 5
stdout
copy 
9 9
https://ideone.com/rJUUIf
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!