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. bool isPossible(int n, int mid){
  33.  
  34.     vector<int> b(a);
  35.  
  36.     for(int i=n-1; i>=2; i--){
  37.  
  38.         int dif = b[i] - mid;
  39.         int d = min(a[i], dif)/3;
  40.  
  41.         if(dif<0) return false;
  42.  
  43.         b[i-2] += 2*d;
  44.         b[i-1] += d;
  45.         b[i] -= 3*d;
  46.     }
  47.  
  48.  
  49.     for(int i=0; i<n; i++){
  50.         if(b[i] < mid) return false;
  51.     }
  52.     return true;
  53. }
  54.  
  55. int consistency(int n){
  56.  
  57.     int s = 0, e = INF;
  58.  
  59.     while(s<e){
  60.         int mid = s + (e-s+1)/2;
  61.         if(isPossible(n, mid)){
  62.             s = mid;
  63.         }
  64.         else{
  65.             e = mid-1;
  66.         }
  67.     }
  68.  
  69.     return s;
  70. }
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86. int practice(int n){
  87.  
  88.  
  89.     return 0;
  90. }
  91.  
  92.  
  93.  
  94.  
  95.  
  96. void solve() {
  97.  
  98.     int n;
  99.     cin>> n;
  100.  
  101.     a.resize(n);
  102.     for(int i=0; i<n; i++) cin >> a[i];
  103.  
  104.     cout << consistency(n) << endl;
  105.  
  106.  
  107. }
  108.  
  109.  
  110.  
  111.  
  112.  
  113. int32_t main() {
  114.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  115.  
  116.     int t = 1;
  117.     cin >> t;
  118.     while (t--) {
  119.         solve();
  120.     }
  121.  
  122.     return 0;
  123. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
4
4
1 2 10 100
4
100 100 100 1
5
5 1 1 1 8
6
1 2 3 4 5 6
stdout
copy 
7
1
1
3
https://ideone.com/5it7wW
language:
C++14 (gcc 8.3)
created:
22 hours 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!