fork(1) 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. //* Wrong 
  60.  
  61. int consistency2(int n){
  62.  
  63. 	vector<int> dp(n+1, INF);
  64. 	dp[0] = 0;
  65. 	unordered_map<int,int> mp = {{a[0]+1, 0}};
  66.  
  67. 	for(int i=1; i<=n; i++){
  68.  
  69. 		if(mp.count(a[i-1]+i)){
  70. 			mp[a[i-1]+i] = min(mp[a[i-1]+i], dp[i-1]);
  71. 		}
  72. 		else{
  73. 			mp[a[i-1]+i] = dp[i-1];
  74. 		}
  75.  
  76. 		if(mp.count(i)){
  77. 			dp[i] = mp[i];
  78. 		}
  79. 		else{
  80. 			dp[i] = i;
  81. 		}
  82. 	}
  83.  
  84. 	return dp[n];
  85. }
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95. int practice(int n){
  96.  
  97.  
  98.     return 0;
  99. }
  100.  
  101.  
  102.  
  103.  
  104.  
  105. void solve() {
  106.  
  107.     int n;
  108.     cin>> n;
  109.  
  110.     a.resize(n);
  111.     for(int i=0; i<n; i++) cin >> a[i];
  112.  
  113.     cout << consistency1(n) << " " << consistency2(n) << endl;
  114.  
  115.  
  116. }
  117.  
  118.  
  119.  
  120.  
  121.  
  122. int32_t main() {
  123.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  124.  
  125.     int t = 1;
  126.     // cin >> t;
  127.     while (t--) {
  128.         solve();
  129.     }
  130.  
  131.     return 0;
  132. }
Success #stdin #stdout 0.01s 5312KB
comments (?)
stdin
copy 
7
3 7 2 6 1 2 4
stdout
copy 
1 7
https://ideone.com/XDNx8n
language:
C++14 (gcc 8.3)
created:
9 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!