Comments

• 
  

  1

  

  hanguyen140210  commented on Jan. 6, 2026, 7:16 a.m.

  include<bits/stdc++.h>

  using namespace std;

  define vec vector

  define ll long long

  int i,j; int main(){ iosbase::syncwith_stdio(0); cin.tie(0);cout.tie(0); int n;cin>>n; vec<int>a(n+1),b(n+1),dp(n+1); for(i=1;i<=n;i++)cin>>a[i]; for(i=1;i<n;i++)cin>>b[i]; dp[0]=0; dp[1]=a[1]; for(i=2;i<=n;i++){ dp[i]=min( dp[i-1]+a[i], dp[i-2]+b[i-1] ); } cout<<dp[n]; }

• 
  

  1

  

  vominhmanh10  commented on Nov. 1, 2025, 3:15 a.m. ← edit 3 →

  quy hoạch động thôi, trạng thái là tới người chỉ số i
  nếu mua cho mình, ghép với người trước đó dp[i - 1] + a[i]
  nếu mua luôn cho người ta, tính người trước đó nữa dp[i - 2]) + b[i]
  => dp[i] = min(dp[i - 1] + a[i], dp[i - 2] + b[i])

  import sys
  inf = float('inf')
  def main(n, a, b):
      dp = [0] * n
      dp[0] = a[0]
      dp[1] = min(a[0] + a[1], b[1])
      for i in range(2, n):
          dp[i] = min(dp[i - 1] + a[i], dp[i - 2] + b[i])
      return dp[n - 1]
  
  input = sys.stdin.readline
  n = int(input())
  a = list(map(int, input().split()))
  b = [0] + list(map(int, input().split()))
  print(main(n, a, b))
  

• 
  

  1

  

  Taihsgtinsonhong  commented on Dec. 19, 2025, 8:49 a.m.

  ok

• 
  

  -5

  

  ngphong15082001  commented on Aug. 3, 2025, 10:15 a.m.

  def DP(n, t, r): dp = [0] * (n+1) dp[0], dp[1] = 0, t[0] for i in range(2, n+1): dp[i] = min(dp[i-1] + t[i-1], dp[i-2] + r[i-2]) return dp[n]

  def main(): n = int(input()) t = list(map(int, input().split()))[:n] r = list(map(int, input().split()))[:n-1]

  res = DP(n, t, r)
  print(res)
  

  main()

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -13

  

  vutuankiet  commented on July 20, 2025, 2:55 p.m.

  xin downvote

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -33

  

  khiemgia1105  commented on Oct. 4, 2024, 7:48 a.m.

  Mn đăng kí khoắ học ở prf mình nhé, cam kết có giải

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -9

  

  Huy_inIT  commented on Aug. 8, 2024, 12:30 p.m.

  ** #include <bits/stdc++.h>

  define MASK(i) (1LL << (i))

  define all(x) x.begin(), x.end()

  define setpr(x) cout<<setprecision(x)<<fixed

  define fastbuild ios::syncwithstdio(false); cin.tie(0);

  define whatIs(x) cerr << "Line " << LINE << ": " << #x << " = " << (x) << endl

  typedef long long ll; using namespace std;

  signed main() { int n; cin >> n; vector<int> t(n+1); vector<int> r(n+1); for(int i=1; i<=n; i++) cin >> t[i]; for(int i=1; i<=n; i++) cin >> r[i];

  /*
      moi nguoi can mua 1 ve, nguoi bán hàn được phép bán tối đa 2 vé 
      người i mua tốn t[i]
      người i+1 rời khỏi hàng và nhờ người i mua hộ vé tốn r[i] thời gian
      dp[i]: tổng thời gian bé nhất để mua kể từ người thứ 1 tới người thứ 1
      dp[1] = a[1]
      dp[2] = min(dp[1] + a[2], r[1])
      dp[i] = min(dp[i-1] + a[2], dp[i-2] + r[i-1])
  */
  int dp[60010];
  memset(dp, 10000000, sizeof(int));
  dp[1] = t[1];   
  dp[2] = min(dp[1] + t[2], r[1]);
  for(int i=3; i<=n; i++)
  {
      dp[i] = min(dp[i-1] + t[i], dp[i-2] + r[i-1]);
  }
  cout << dp[n];
  return 0;
  

  }

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -12

  

  MalazeKL  commented on July 2, 2024, 6:04 p.m. ← edit 6 →

  .

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -11

  

  MalazeKL  commented on July 2, 2024, 6:05 p.m. ← edited →

  .

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -34

  

  hieuz08  commented on June 11, 2024, 2:12 a.m.

  ĐỊt mẹ thg Minh Hiếu 3==Đ

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -6

  

  nhanphamj  commented on July 27, 2024, 2:24 p.m.

  ko chửi bạn

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -16

  

  a3k27_13_nguyenvantai  commented on March 30, 2024, 3:48 p.m.

  include<bits/stdc++.h>

  using namespace std; using ll = long long; const int N = 1e6 + 9; ll dp[600009][3], i, j, n, a[N], b[N]; int main() {

  define taskname ""

  if (fopen (taskname".inp", "r"))
  {
      freopen (taskname".inp", "r", stdin);
      freopen (taskname".out", "w", stdout);
  }
  cin.tie (0)->sync_with_stdio (0);
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 2; i <= n; i++) cin >> b[i];
  dp[1][0] = 1e18;
  dp[1][1] = a[1];
  for (i = 2; i <= n; i++)
  {
      dp[i][1] = 1e18;
      dp[i][0] = dp[i - 1][1] - a[i - 1] + b[i];
      dp[i][1] = min (dp[i - 1][0], dp[i - 1][1]) + a[i];
  }
  cout << min (dp[n][1], dp[n][0]);
  return 0;
  

  }

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -9

  

  thanhhoang  commented on Jan. 23, 2024, 7:01 p.m.

  Quy Hoạch Động f[n] = t[n]; f[i] = min( t[i] + f[i + 1], r[i] + f[i + 2] ) ( i : n - 1 --> 1 )

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -6

  

  thanhhoang  commented on Jan. 23, 2024, 7:02 p.m.

  => f[1]

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -22

  

  Cuunon311  commented on Oct. 8, 2023, 4:14 a.m.

  uk

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -43

  

  kevininyourarea  commented on April 14, 2023, 1:46 a.m.

  để cmt ở đây để xin upvote :>

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -40

  

  NguyenDongAnh  commented on Sept. 9, 2022, 2:29 p.m. ← edited →

  Bài Hay nhỉ

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  30

  

  sickboy1368  commented on Jan. 11, 2022, 6:46 a.m.

  quy hoạch động so sánh ( f[i-1] + t[i] ) với ( f[i-2] + r[i-1] )

• 
  

  -67

  

  nictysine1  commented on Feb. 16, 2022, 8:41 a.m. ← edited →

  upvote

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -385

  

  ltphuc  commented on April 20, 2021, 3:45 a.m.

  Em la newbie moi bat dau hoc tin, ai co the cho em xin code voi a, em cam on moi nguoi nhieu

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -154

  

  nngovannhhungg  commented on Jan. 15, 2022, 7:19 a.m.

  cần thêm 2 người downvote nx cho chẵn :))

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -170

  

  manhtuan22007  commented on Nov. 27, 2021, 12:54 p.m.

  cần thêm 1 người downvote nx cho chẵn :))

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -167

  

  ekhoavvdd  commented on Nov. 22, 2021, 4:31 p.m.

  cần thêm 1 người downvote nữa cho chẵn :))

  This comment is hidden due to too much negative feedback. Show it anyway.