제출 #909969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
909969		IUA_Hasin	Stone Arranging 2 (JOI23_ho_t1)	C++17	0 / 100	0 ms	348 KiB

Main

#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
 
using namespace std;
 
int main ()
{
    ll n;
    cin>>n;
    ll arr[n];

    for (int i=0; i<n; i++){
        cin>>arr[i];
    }

    ll a = arr[0];
    ll cnta = 0;
    ll cntaa = 0;

    if(n==1){
        cout<<a<<endl;
    } else {
       while(cnta<n-1){
        cntaa = cnta;
        a = arr[cnta];
        for (int i=cnta; i<n; i++){
            if(arr[i]==a){
                cnta = i;
            }
        }
        for(int i=cntaa; i<=cnta; i++){
            cout<<a<<endl;
        }
        cnta = cnta + 1;
        // if(cnta>=n-1){
        //     break;
        // }
        } 
    }    
     
    return 0;
  
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40