Comments

• 
  

  -1

  

  L8_DuongThanhKhiem  commented on Nov. 15, 2025, 2:56 a.m.

  Sao mn phải làm dài vậy, mình làm đúng 13 dòng, full AC:

  #include <bits/stdc++.h>
  using namespace std;
  short n;
  vector <int> a;
  int main() {
      cin >> n;
      a.resize(n);
      for (int i = 0;i < n;i++)cin >> a[i];
      for (int i = 1;i < n - 1;i++){
          if (a[i] > a[i - 1] && a[i] > a[i + 1])cout << a[i] << " ";
      }
      return 0;
  }
  

• 
  

  0

  

  kietne  commented on Dec. 13, 2025, 2:38 a.m.

  code bạn ngắn nhưng chạy lâu thuật toán chưa tối ưu

• 
  

  -1

  

  naipret  commented on Sept. 18, 2025, 7:58 a.m.

  #include <iostream>
  #include <vector>
  
  using namespace std;
  
  bool IsGreatest(int val_1, int val_2, int val_3) {
    return (val_2 > val_1 && val_2 > val_3);
  }
  
  int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  
    int num;
    cin >> num;
  
    vector<int> vec(num);
    for (int &ele : vec) {
      cin >> ele;
    }
  
    for (int idx = 1; idx < num - 1; idx++) {
      if (IsGreatest(vec[idx - 1], vec[idx], vec[idx + 1])) {
        cout << vec[idx] << ' ';
      }
    }
  }
  

• 
  

  0

  

  hngoc  commented on July 4, 2025, 2:54 p.m.

  n=input()
  a=input().split()
  a[0]=int(a[0])
  a[1]=int(a[1])
  for i in range(1, len(a)-1):
      a[i+1]=int(a[i+1])
      if a[i]>a[i-1] and a[i]>a[i+1]:
          print(a[i],end=' ')
  

• 
  

  0

  

  MisolHo  commented on Jan. 19, 2025, 7:40 a.m.

  include <bits/stdc++.h>

  using namespace std;

  int main(){

  int n;
  cin >> n;
  
  int a[n];
  for(int i = 0 ; i < n ; i++){
      cin >> a[i];
  }   
  
  for(int i = 0 ; i < n ; i++){
      if(i == 0 || i == n-1){
          continue;
      } else if(a[i] > a[i-1] && a[i] > a[i+1]){
          cout << a[i] << " ";
      }
  }
  return 0;
  

  }

• 
  

  -2

  

  VDev  commented on Jan. 17, 2025, 12:47 p.m.

  FULL AC

  #include <bits/stdc++.h>
  #include <iomanip>
  #include <cmath>
  #include <climits>
  #define ll long long
  using namespace std;
  ll a[10000011];
  ll cnt = 0, s = 0;
  
  int main(){
      ll n;
      cin >> n;
      for(ll i = 1; i <= n; i++){
          cin >> a[i];
      }
      for(ll i = 2; i < n; i++){
              if(a[i] > a[i + 1] && a[i] > a[i - 1]){
                  cout << a[i] << " ";
              }
      }
      return 0;
  }
  

• 
  

  -2

  

  Phamanh08  commented on Dec. 27, 2024, 2:49 p.m.

  mọi người xem giúp em xem code sai ở đâu ạ ;-;, em cảm ơn

  include <bits/stdc++.h>

  using namespace std; int main() { long long n;cin>>n; long long a[n]; for(int i=0;i<n;i++) cin>>a[i]; vector<int> l; for(int i=0;i<n;i++){ if(a[i]>a[i+1] && a[i]>a[i-1]) { l.push_back(a[i]); } } for(int i:l) cout<<i<<' '; return 0; }

• 
  

  -1

  

  knight01  commented on Jan. 8, 2025, 7:42 p.m.

  ko xet 2 vi tri dau tien

• 
  

  -1

  

  Phamanh08  commented on Jan. 22, 2025, 4:19 p.m.

  em cam on a!

• 
  

  -11

  

  theguy777_jaboi  commented on Aug. 7, 2024, 2:02 a.m.

  

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

• 
  

  -13

  

  theguy777_jaboi  commented on Aug. 7, 2024, 2:01 a.m.

  

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

• 
  

  -15

  

  theguy777_jaboi  commented on Aug. 7, 2024, 2:01 a.m.

  

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