Comments

• 
  

  0

  

  jammyjunior  commented on Feb. 12, 2026, 10:28 a.m.

  Bai nay hoan toan co the giai ma khong su dung array. Hay hoan thanh bai truoc khi doc loi giai nay. Tgian chay: 0.02 s Space: 8.00 KB 🔥

  https://ide.usaco.guide/OlGNunII23imkYuiomz

  Good luck!

• 
  

  -1

  

  hoangquys  commented on Nov. 16, 2025, 10:48 a.m. ← edited →

  include <bits/stdc++.h>

  using namespace std;

  int main() { int n; cin >> n; int a[n], b[n], c[n], dp[n][3]; for (int i = 0; i < n; i++) cin >> a[i] >> b[i] >> c[i]; dp[0][0] = a[0]; dp[0][1] = b[0]; dp[0][2] = c[0]; for (int i = 1; i < n; i++) { dp[i][0] = a[i] + max(dp[i-1][1], dp[i - 1][2]); dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]); dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]); } cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]); return 0; }

• 
  

  2

  

  vominhmanh10  commented on Oct. 31, 2025, 10:31 a.m. ← edited →

  quy hoạch động thôi, các trạng thái là tới ngày i, và ngày i đã chọn 1 trong 3 cái nào
  vì không được 2 ngày liên tiếp trở lên nên chỉ xét dp[i - 1] với các lựa chọn khác lựa chọn đang dùng
  dp[i][0] = a[i][0] + max(dp[i - 1][1] + dp[i - 1][2])...

  n = int(input())
  a = [tuple(map(int, input().split())) for _ in range(n)]
  dp = [[0] * 3 for _ in range(n)]
  dp[0][0] = a[0][0]
  dp[0][1] = a[0][1]
  dp[0][2] = a[0][2]
  for i in range(1, n):
      dp[i][0] = a[i][0] + max(dp[i - 1][1], dp[i - 1][2])
      dp[i][1] = a[i][1] + max(dp[i - 1][0], dp[i - 1][2])
      dp[i][2] = a[i][2] + max(dp[i - 1][0], dp[i - 1][1])
  print(max(dp[n - 1]))
  

• 
  

  -12

  

  LVT_K66_TRANDUYBAO  commented on July 26, 2025, 1:56 a.m.

  xin dowvote

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

• 
  

  -14

  

  vutuankiet  commented on July 19, 2025, 3:40 p.m.

  xin downvote

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

• 
  

  1

  

  HUNG2010  commented on May 31, 2025, 3:07 a.m.

  Code tham khảo: https://ide.usaco.guide/ORZ9PR885-KVvWChqfx

• 
  

  -15

  

  NgocQuang  commented on Feb. 20, 2025, 12:29 a.m.

  ezzzzzzz

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

• 
  

  -12

  

  tanhphungvivo2009  commented on Jan. 13, 2025, 11:53 a.m.

  ez no dif

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

• 
  

  -27

  

  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.

• 
  

  -97

  

  hanhsky  commented on Sept. 29, 2023, 10:13 a.m.

  include <bits/stdc++.h>

  using namespace std;

  define pb push_back

  define fo(i, l, r , k) for(int i = l; i <= r; i += k)

  define foi(i, l, r , k) for(int i = l; i >= r; i -= k)

  define elif else if

  define el cout << "\n";

  define pii pair<int, int>

  define fi first

  define se second

  define in(x) freopen(x, "r", stdin)

  define out(x) freopen(x, "w", stdout)

  define ll long long

  define pob pop_back

  define bs binary_search

  define vii vector<int>

  define low lower_bound

  define up upper_bound

  const int N = 1e5 + 11; const int inf = INT_MAX; const int mod = 1e9 + 7; int TC; int n ; int a[N][3]; ll f[N][3]; void inp() { cin >> n ; fo(i , 1 , n , 1) { fo(j , 1 , 3 , 1) { cin >> a[i][j]; } } } void sol() { fo(i , 1 , n , 1) { f[i][1] = max(f[i - 1][2] , f[i - 1][3]) + a[i][1]; f[i][2] = max(f[i - 1][1] , f[i - 1][3]) + a[i][2]; f[i][3] = max(f[i - 1][2] , f[i - 1][1]) + a[i][3]; } ll res = -inf; fo(j , 1 , 3 , 1) { res = max(res , f[n][j]); } cout << res << endl; } int main(){ TC = 1; while(TC--) { inp(); sol(); } return 0; } Xin downvote )):

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