全部回复 共 4 条

1. 黑暗中的那颗星为你而闪耀 #1 楼主 · 2025-07-26

   include <bits/stdc++.h>

   using namespace std; const int N=1e9; int a[1000005],dp[1000005]; int main() {

   int n;
   cin>>n;
   int t=0;
   for(int i=1;i<=n;i++){
   	cin>>a[i];
   	dp[i]=N;
   }
   dp[n+1]=N;	
   for(int i=1;i<=n+1;i++){
   	dp[i]=min(dp[i],dp[i-1]);
   	dp[i]=min(dp[i],dp[i-2]);
   	dp[i]=min(dp[i],dp[i-3]);
   	dp[i]+=a[i];
   }
   cout<<dp[n+1];
   return 0;
   

   }

2. 黑暗中的那颗星为你而闪耀 #2 楼主 · 2025-07-26

   include <bits/stdc++.h>

   using namespace std; const int N=1e9; int a[1000005],dp[1000005]; int main() {

   int n;
   cin>>n;
   int t=0;
   for(int i=1;i<=n;i++){
   	cin>>a[i];
   	dp[i]=N;
   }
   dp[n+1]=N;	
   for(int i=1;i<=n+1;i++){
   	dp[i]=min(dp[i],dp[i-1]);
   	dp[i]=min(dp[i],dp[i-2]);
   	dp[i]=min(dp[i],dp[i-3]);
   	dp[i]+=a[i];
   }
   cout<<dp[n+1];
   return 0;
   

   }

3. 黑暗中的那颗星为你而闪耀 #3 楼主 · 2025-07-26

   include <bits/stdc++.h>

   using namespace std; const int N=1e9; int a[1000005],dp[1000005]; int main() {

   int n;
   cin>>n;
   int t=0;
   for(int i=1;i<=n;i++){
   	cin>>a[i];
   	dp[i]=N;
   }
   dp[n+1]=N;	
   for(int i=1;i<=n+1;i++){
   	dp[i]=min(dp[i],dp[i-1]);
   	dp[i]=min(dp[i],dp[i-2]);
   	dp[i]=min(dp[i],dp[i-3]);
   	dp[i]+=a[i];
   }
   cout<<dp[n+1];
   return 0;
   

   }

4. 黑暗中的那颗星为你而闪耀 #4 楼主 · 2025-07-26

   include <bits/stdc++.h>

   using namespace std; const int N=1e9; int a[1000005],dp[1000005]; int main() {

   int n;
   cin>>n;
   int t=0;
   for(int i=1;i<=n;i++){
   	cin>>a[i];
   	dp[i]=N;
   }
   dp[n+1]=N;	
   for(int i=1;i<=n+1;i++){
   	dp[i]=min(dp[i],dp[i-1]);
   	dp[i]=min(dp[i],dp[i-2]);
   	dp[i]=min(dp[i],dp[i-3]);
   	dp[i]+=a[i];
   }
   cout<<dp[n+1];
   return 0;
   

   }