Submission #974179

#TimeUsernameProblemLanguageResultExecution timeMemory
97417912345678Akcija (COCI15_akcija)C++17
16 / 80
8 ms2396 KiB
#include <bits/stdc++.h> using namespace std; const int nx=1e5+5; #define ll long long ll n, c[nx], dp[nx]; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=1; i<=n; i++) cin>>c[i]; for (int i=1; i<=n; i++) { dp[i]=dp[i-1]+c[i]; if (i>=3) dp[i]=min(dp[i], dp[i-3]+c[i-2]+c[i-1]+c[i]-min(c[i-2], min(c[i-1], c[i]))); } cout<<dp[n]; }
#Verdict Execution timeMemoryGrader output
Fetching results...