fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. inline int power(int a, int b) {
  6.     int x = 1;
  7.     while (b) {
  8.         if (b & 1) x *= a;
  9.         a *= a;
  10.         b >>= 1;
  11.     }
  12.     return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25.  
  26. vector<int> a;
  27. void consistency(int n) {
  28.  
  29. 	int ans = 0;
  30. 	int last = LINF;
  31. 	for(int i=n-1; i>=0; i--){
  32. 		if(a[i] <= last){
  33. 			last = a[i];
  34. 			continue;
  35. 		}
  36. 		int maxPartitions = (a[i]+last-1) / last;
  37.  
  38. 		//* 26/8 =>  2 8 8 8 ==  6 6 6 6 == 6 6 7 7 
  39. 		//* rem to distribute == 0, 1, 2, 3 ==> (6,6,6,6) or (6,6,6,7) or (6,6,7,7) or (6,7,7,7)
  40. 		//* hence last == 6 guranteed i.e. a[i] / partitions
  41.  
  42. 		ans += (maxPartitions-1);
  43.  
  44. 		last = a[i] / maxPartitions;
  45.  
  46. 	}
  47.  
  48. 	cout << ans << endl;
  49. }
  50.  
  51.  
  52. void solve() {
  53.  
  54. 	int n;
  55. 	cin >> n;
  56. 	a.resize(n);
  57. 	for(int i=0; i<n; i++) cin >> a[i];
  58.  
  59.     consistency(n) ;
  60.  
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67. int32_t main() {
  68.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  69.  
  70.     int t = 1;
  71.     cin >> t;
  72.     while (t--) {
  73.         solve();
  74.     }
  75.  
  76.     return 0;
  77. }
Success #stdin #stdout 0.01s 5328KB
comments (?)
stdin
copy 
2
5
5 6 5 7 9
3
5 26 8
stdout
copy 
2
3
https://ideone.com/OWdFKc
language:
C++14 (gcc 8.3)
created:
12 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!