fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long
  4. #define dd double
  5. #define ld long double
  6. #define ull unsigned long long
  7. #define yes cout << "YES\n"
  8. #define no cout << "NO\n"
  9. #define el "\n"
  10. #define Arwa ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  11. #define fix(x) cout << fixed << setprecision(x)
  12. #define all(v) v.begin(),v.end()
  13. #define dpp(v,val) memset(v,val,sizeof(v))
  14. #define mod 1e9+7
  15. #define oo 1e9
  16. const int N = 1e5 + 5;
  17. int n;
  18. vector<int>v;
  19. int dp[102][4];
  20. int solve(int i,int j) 
  21. {
  22.   if(i==n) return 0;
  23.   int& ret=dp[i][j];
  24.   if(ret!=-1) return ret;
  25.   int l=solve(i+1,j),t=0;
  26.   if(j==0)
  27.   {
  28.     if(v[i]==0) t=solve(i+1,v[i]);
  29.     else if(v[i]==3) t=max(solve(i+1,2),solve(i+1,1))+1;
  30.     else t=solve(i+1,v[i])+1;
  31.   }
  32.  
  33.   if(j==1)
  34.   {
  35.     if(v[i]==0) t=solve(i+1,v[i]);
  36.     else if(v[i]==3||v[i]==2) t=solve(i+1,2)+1;
  37.   }
  38.  
  39.   if(j==2)
  40.   {
  41.     if(v[i]==0) t=solve(i+1,v[i]);
  42.     else if(v[i]==3||v[i]==1) t=solve(i+1,1)+1;
  43.   }
  44.   return ret=max(t,l);
  45. }
  46. void HereWeGoAgain()
  47. {
  48.   cin>>n;
  49.   v.resize(n);
  50.   for(int i=0;i<n;i++) cin>>v[i];
  51.   dpp(dp,-1);
  52.   cout<<n-solve(0,0);
  53. }
  54. int32_t main() 
  55. {
  56.     Arwa
  57.     int t=1;
  58.     //cin>>t;
  59.     for(int i=1;i<=t;i++)
  60.     {
  61.     HereWeGoAgain();
  62.     }
  63.     return 0;
  64. }
Success #stdin #stdout 0.01s 5308KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/h8VnHr
language:
C++ (gcc 8.3)
created:
2 days 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!