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> dp(n+1, INF);
  35. 	dp[0] = 0;
  36. 	if(a[0] == 0) dp[1] = 0;
  37. 	else dp[1] = 1;
  38.  
  39. 	for(int i=2; i<=n; i++){
  40.  
  41. 		int j = i-1;
  42. 		while(j>=0){
  43.  
  44. 			if(a[j]+1 == i-j){
  45. 				dp[i] = min(dp[i], dp[j]);
  46. 			}
  47. 			else dp[i] = min(dp[i], dp[j] + i-j);
  48. 			j--;
  49. 		}
  50.  
  51. 	}
  52.  
  53. 	return dp[n];
  54. }
  55.  
  56.  
  57.  
  58.  
  59. //* APproach 2 : 
  60.  
  61. int consistency2(int n){
  62.  
  63. 	vector<int> dp(n+1, INF);
  64. 	dp[0] = 0;
  65. 	if(a[0] == 0) dp[1] = 0;
  66. 	else dp[1] = 1;
  67.  
  68. 	for(int i=2; i<=n; i++){
  69.  
  70. 		int j = i-1;
  71. 		while(j>=0){
  72.  
  73. 			if(a[j]+1 == i-j){
  74. 				dp[i] = min(dp[i], dp[j] + 0);
  75. 			}
  76. 			j--;
  77. 		}
  78.  
  79. 		dp[i] = min(dp[i], dp[i-1]+1);
  80.  
  81. 	}
  82.  
  83. 	return dp[n];
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. int consistency3(int n) {
  91.     vector<int> dp(n + 1, INF);
  92.     dp[0] = 0;
  93.  
  94.     if (a[0] == 0) dp[1] = 0;
  95.     else dp[1] = 1;
  96.  
  97.     unordered_map<int, int> mp = {{a[0] + 1, dp[0]}};
  98.  
  99.     for (int i = 2; i <= n; i++) {
  100.  
  101.         if (mp.count(i)) {
  102.             dp[i] = mp[i];
  103.         }
  104.  
  105.         dp[i] = min(dp[i], dp[i-1] + 1);
  106.  
  107.         if (mp.count(a[i-1]+i)) {
  108.             mp[a[i-1]+i] = min(mp[a[i-1]+i], dp[i-1]);
  109.         } else {
  110.             mp[a[i-1]+i] = dp[i-1];
  111.         }
  112.     }
  113.  
  114.     return dp[n];
  115. }
  116.  
  117.  
  118.  
  119.  
  120. //? Approach 3 : Backwards 
  121.  
  122.  
  123. int consistency4(int n) {
  124.     vector<int> dp(n + 1, INF);
  125.     dp[0] = 0;
  126.  
  127.  
  128.  
  129.     return dp[n];
  130. }
  131.  
  132.  
  133.  
  134.  
  135.  
  136.  
  137.  
  138.  
  139.  
  140.  
  141. int practice(int n){
  142.  
  143.  
  144.     return 0;
  145. }
  146.  
  147.  
  148.  
  149.  
  150.  
  151. void solve() {
  152.  
  153.     int n;
  154.     cin>> n;
  155.  
  156.     a.resize(n);
  157.     for(int i=0; i<n; i++) cin >> a[i];
  158.  
  159.     cout << consistency1(n) << " " << consistency2(n) << " " << consistency3(n) << " " << consistency4(n) << endl;
  160.  
  161.  
  162. }
  163.  
  164.  
  165.  
  166.  
  167.  
  168. int32_t main() {
  169.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  170.  
  171.     int t = 1;
  172.     // cin >> t;
  173.     while (t--) {
  174.         solve();
  175.     }
  176.  
  177.     return 0;
  178. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
7
3 7 2 6 1 2 4
stdout
copy 
1 1 1 2000000001
https://ideone.com/kl06T6
language:
C++14 (gcc 8.3)
created:
2 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!