Comments

• 
  

  0

  

  tinhoc   commented on July 14, 2024, 9:11 p.m.

  n,L,R=map(int,input().split(' ')) A=list(map(int,input().split(' '))) i=0 B=[] while i<len(A): tam=0 dem=0 j=i while j<len(A): tam=tam+A[j] dem=dem+1 if dem>=L and dem<=R: B.append(tam) j=j+1 if dem>R: break i=i+1 c=max(B)
  print(c)

• 
  

  0

  

  khangbusu   commented on June 8, 2024, 9:28 p.m.

  ai có code python bài bất kỳ nào ko cho xin với

• 
  

  0

  

  KPKTuan   commented on June 9, 2024, 9:15 a.m.

  Bài 3: def ChatCay(DayCay,BatDau,KetThuc): TongChenhLech = 0 DiemBatDau = 0 for i in DayCay: if BatDau <= i <= KetThuc: if DiemBatDau == 0: DiemBatDau = i else: TongChenhLech += abs(i - DiemBatDau) DiemBatDau = i return TongChenhLech

  n,q = map(int,input().split(" ")) a = list(map(int,input().split(" "))) DuLieu = [] for i in range(q): BatDau,KetThuc = map(int,input().split(" ")) DuLieu.append((BatDau,KetThuc))

  for BatDau,KetThuc in DuLieu: print(ChatCay(a,BatDau,KetThuc))

• 
  

  -2

  

  van1712010   commented on June 6, 2024, 10:14 p.m.

  cho mình xin full code bài 1 với

• 
  

  4

  

  PhanGiaKhang   commented on June 7, 2024, 5:23 a.m.

  đây nhé bạn

  #include <bits/stdc++.h>
  using namespace std;
  
  int main() {
      ios_base::sync_with_stdio(false);
      cin.tie(nullptr); cout.tie(nullptr);
  
      int n, l, r; 
      cin >> n >> l >> r;
  
      vector<int> a(n);
      for (int i = 0; i < n; ++i) {
          cin >> a[i];
      }
  
      vector&lt;long long> pfsum(n + 1, 0); 
      for (int i = 0; i < n; ++i) {
          pfsum[i + 1] = pfsum[i] + a[i];
      }
  
      long long maxs = LLONG_MIN; 
  
      for (int i = 0; i <= n - l; ++i) {
          for (int j = l; j <= r && i + j <= n; ++j) {
              long long sum = pfsum[i + j] - pfsum[i]; 
              maxs = max(maxs, sum);
          }
      }
  
      cout << maxs << endl;
  
      return 0;
  }
  

• 
  

  2

  

  khangbusu   commented on June 7, 2024, 9:57 p.m.

  có code python không bạn

• 
  

  0

  

  tinhoc   commented on July 14, 2024, 9:10 p.m.

  n,L,R=map(int,input().split(' ')) A=list(map(int,input().split(' '))) i=0 B=[] while i<len(A): tam=0 dem=0 j=i while j<len(A): tam=tam+A[j] dem=dem+1 if dem>=L and dem<=R: B.append(tam) j=j+1 if dem>R: break i=i+1 c=max(B)
  print(c)

• 
  

  -1

  

  KPKTuan   commented on June 8, 2024, 2:18 p.m.

  có nhưng bủ bủ lmao lắm :((

• 
  

  0

  

  PhanGiaKhang   commented on June 8, 2024, 7:01 a.m.

  không bạn ơi chỗ tôi toàn sài C++

• 
  

  0

  

  van1712010   commented on June 7, 2024, 9:05 p.m.

  bạn có code pascal không ấy

• 
  

  1

  

  PhanGiaKhang   commented on June 8, 2024, 7:03 a.m.

  không á bạn tui làm bằng C++ không à

• 
  

  -2

  

  KPKTuan   commented on June 8, 2024, 2:56 p.m.

  Bạn bao nhiu điểm?