Submission #61591951

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    ll ans=0;
    deque<ll> M;
    for(int i = 0; i < N; i++){
        ll a;
        cin >> a;
        M.push_back(a);
        if(i>=N/2&&M.front()*2<=a){
            ans++;
            M.pop_back();
            M.pop_front();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    cin >> N;
    ll ans=0;
    deque<ll> M;
    for(int i = 0; i < N; i++){
        ll a;
        cin >> a;
        M.push_back(a);
        if(i>=N/2&&M.front()*2<=a){
            ans++;
            M.pop_back();
            M.pop_front();
        }
    }
    while(!M.empty()){
        M.pop_back();
    }
    cout << ans;

    return 0;
}

Submission Info

Judge Result