Comments

• 
  

  -3

  

  VDev  commented on Feb. 23, 2025, 8:53 a.m.

  FULL AC

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

• 
  

  -1

  

  nguyenkhanhhai  commented on Feb. 9, 2025, 3:53 p.m.

  include <bits/stdc++.h>

  using namespace std; typedef long long ll;

  define fastio iosbase::syncwith_stdio(false); cin.tie(NULL);

  int main() { fastio int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; a[n] = 0; int cnt = 0; for (int i = 0; i <= n; i++) { if (a[i] == 1) { cnt++; } else { if (cnt>0) cout << cnt << ' '; cnt = 0; } } cout << '\n'; a[n] = 1; for (int i = 0; i <= n; i++) { if (a[i] == 0) { cnt++; } else { if (cnt>0) cout << cnt << ' '; cnt = 0; } } return 0; }

• 
  

  -8

  

  km197  commented on Sept. 20, 2024, 11:55 a.m.

  package org.example;

  import java.util.Scanner;

  public class Bai39 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] F = new int[n + 1]; for (int i = 0; i < n; i++) { F[i] = sc.nextInt(); } F[n] = 0; int dem = 0; for (int i = 0; i < n; i++) { if (F[i] == 1) { dem++; if (F[i + 1] == 0) { System.out.print(dem + " "); dem = 0; } } } System.out.println(""); F[n] = 1; int dem2 = 0; for (int i = 0; i <= n; i++) { if (F[i] == 0) { ++dem2; if (F[i + 1] == 1) { System.out.print(dem2 + " "); dem2 = 0; } } } } }

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

• 
  

  -8

  

  dgh2204  commented on Sept. 6, 2024, 7:42 a.m.

  include<stdio.h>

  int main() { int n ;scanf("%d",&n); int a[n] ; for(int i=0;i<n;i++) scanf("%d",a+i); int cnt =0;

  for( int i=0;i<n;i++) {

  if(a[i] ==1 ) ++cnt; else { // else if( cnt>0) { printf("%d",cnt) ,cnt=0;} if( cnt >0) printf("%d",cnt); cnt =0; } if( cnt >0)
  // cap nhap cho a[n-1] { printf("%d",cnt);

  } int d=0 ;

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

• 
  

  -10

  

  Lamlilac1234  commented on Aug. 10, 2024, 3:42 p.m.

  include <iostream>

  include <vector>

  using namespace std;

  int main()

  {

  int n; cin>>n;
  
  int a[n],count;
  
  vector <int> v1,v0;
  
  for(int &x : a )cin>>x;
  
  for( int i =0 ; i&lt;n ;){
  
    if(a[i]==0){
  
      count=0;
  
      count++;
  
      while(a[++i]==0)count++;
  
      v0.push_back(count);
  
    }
  
    else {
  
      count=0;
  
      count++;
  
      while(a[++i]==1)count++;
  
      v1.push_back(count);
  
    }
  
  }
  
  for(int x : v1)cout<&lt;x<<' ';
  
  cout<<'\n';
  
  for(int x : v0)cout<&lt;x<<' ';
  
  return 0;
  

  }

  có cách nào tối ưu hơn ko các bác

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

• 
  

  -9

  

  drwhite  commented on Sept. 2, 2024, 3:43 p.m.

  2 vòng for là xong, chứ dùng vector lưu lmj cho rối lên. 2 vòng for thì chắc 10^9 vẫn chịu đc

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

• 
  

  -17

  

  hairep2005  commented on July 17, 2024, 2:12 a.m.

  include<bits/stdc++.h>

  using namespace std ; int main(){ int n ; cin>> n ; int a[n] ; vector<int> day0 ; vector<int> day1 ; int count = 1 ; for(int i=0;i<n;i++){ cin>>a[i] ; } for(int i=0;i<n-1;i++){ if(a[i]==a[i+1]){ count++ ; } else { if(a[i]==1){ day1.pushback(count) ; } else { day0.pushback(count) ; } count = 1;
  } } if(a[n-1]==a[n-2] and a[n-1] == 1 ){ count++ ; day1.pushback(count) ; } if(a[n-1] ==a[n-2] and a[n-1] ==0){ count++ ; day0.pushback(count) ; } else{ count =1 ; if(a[n-1]==1){ day1.pushback(count) ; } else{ day0.pushback(count) ; } } for(int x : day1){ cout<<x<<" " ; } cout<<endl ; for(int x: day0){ cout<<x<<" " ; } }

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

• 
  

  -21

  

  minhquan2905  commented on June 10, 2024, 6:08 p.m.

  rễ:>

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

• 
  

  -21

  

  NTH11112222  commented on May 25, 2024, 2:24 a.m.

  include <iostream>

  include <vector>

  using namespace std; void printLengths(const vector<int>& A, int val) { int cnt = 0; vector<int> lengths; for (int num : A) { if (num == val) { cnt++; } else if (cnt > 0) { lengths.pushback(cnt); cnt = 0; } } if (cnt > 0) lengths.pushback(cnt); for (int len : lengths) { cout << len << " "; } cout << endl; } int main() { int N; cin >> N; vector<int> A(N); for (int i = 0; i < N; ++i) { cin >> A[i]; } printLengths(A, 1);
  printLengths(A, 0); return 0; } Tham khảo nha mng

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