#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
int a,b;
int operator()(const int x)const{
return a*x+b;
}
};
bool check(line l1,line l2,line l3){
return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
signed main(){
setio();
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin>>n;
int h[n+1];
h[0]=0;
for(int i=1;i<=n;i++){
cin>>h[i];
}
//int dp[n+1][205][205];
int dp[2][205][205];
int now=1,from=0;
memset(dp,0x3f3f3f3f,sizeof(dp));
dp[0][0][0]=0;
for(int i=1;i<=n;i++){
for(int j=0;j<205;j++){
for(int k=0;k<205;k++){
dp[now][j][k]=0x3f3f3f3f;
}
}
for(int j=h[i-1];j>=0;j--){
for(int k=h[i];k>=0;k--){
int x=h[i]-k;
dp[now][j][k]=min({dp[now][j][k+1]+3,dp[now][j+1][k+1]+5,dp[from][x][j+x]+x*7,dp[from][0][j+x]+x*5,dp[from][0][j]+x*3});
debug(i,j,k,dp[now][j][k]);
}
}
swap(now,from);
}
cout<<dp[from][0][0]<<'\n';
}
/*
input:
*/
Compilation message
skyline.cpp: In function 'void setIO(std::string)':
skyline.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyline.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
43 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
860 KB |
Output is correct |
| 2 |
Correct |
1 ms |
860 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1112 KB |
Output is correct |
| 4 |
Correct |
2 ms |
860 KB |
Output is correct |
| 5 |
Correct |
1 ms |
860 KB |
Output is correct |
| 6 |
Correct |
1 ms |
860 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1112 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1112 KB |
Output is correct |
| 9 |
Correct |
1 ms |
856 KB |
Output is correct |
| 10 |
Correct |
2 ms |
860 KB |
Output is correct |
| 11 |
Correct |
10 ms |
860 KB |
Output is correct |
| 12 |
Correct |
3 ms |
860 KB |
Output is correct |
| 13 |
Correct |
12 ms |
856 KB |
Output is correct |
| 14 |
Correct |
20 ms |
1116 KB |
Output is correct |
| 15 |
Correct |
56 ms |
860 KB |
Output is correct |
| 16 |
Correct |
54 ms |
860 KB |
Output is correct |
| 17 |
Correct |
81 ms |
856 KB |
Output is correct |
| 18 |
Correct |
79 ms |
856 KB |
Output is correct |
| 19 |
Correct |
72 ms |
856 KB |
Output is correct |
| 20 |
Correct |
84 ms |
860 KB |
Output is correct |
