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