A. Vacations (DP greed

Add link description
dp The equation is choosing fitness Choose a job Choose the minimum number of days off for the game

#include<bits/stdc++.h>
using namespace std;
const int N=110;
int dp[N][5];// The first i Days off , Minimum rest days for fitness or competition  
int main(){
    
    int n;
    cin>>n;
    memset(dp,0x3f,sizeof dp);
     int x;
    dp[0][0]=dp[0][1]=dp[0][2]=0;
    for(int i=1;i<=n;i++){
    
       
        cin>>x;
        dp[i][0]=min({
    dp[i-1][1],dp[i-1][0],dp[i-1][2]})+1;
        if(x==1||x==3){
    
            dp[i][2]=min(dp[i-1][0],dp[i-1][1]);
        }
        if(x==2||x==3){
    
            dp[i][1]=min(dp[i-1][2],dp[i-1][0]);
        }
    }
    cout<<min({
    dp[n][0],dp[n][1],dp[n][2]});
    return 0;
}