제출 #585708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
585708		3omar_ahmed	Baloni (COCI15_baloni)	C++17	0 / 100	59 ms	14164 KiB

baloni

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std ;
using namespace __gnu_pbds;

#define int long long int
#define ordered_set tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>
#define CEIL(p1, p2) (p1+p2-1)/p2
#define all(a) a.begin() , a.end()
#define alr(a) a.rbegin() , a.rend()
#define FreI(pr1) freopen(pr1, "r", stdin);
#define FreO(pr1) freopen(pr1, "w", stdout);
int32_t main(){
    ios_base::sync_with_stdio(0), cin.tie(0),cout.tie(0);

    int n ;
    cin >> n;
    vector < int > a(n);
    for( auto &i : a ) cin >> i;
    int ans = 0 ;
    a.push_back(0);
    for( int i = 0 ; i < n ; i++ ){
        while ( i < n && a[i] - 1 == a[i+1]) i++;
        ans++;
    }
    cout << ans;
    return 0 ;
}

• Subtask 1: 0 / 100