Submission #1608715

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define MOD 1000000007

int main(){
    int N;
    cin >> N;
    vector<int> D(N);
    for(int i=0; i<N; i++) cin >> D[i];
    sort(D.begin(), D.end());
    vector<long long> dp(N, 0);
    for(int i=0; i<N; i++) dp[i] = i+1;
    for(int i=0; i<3; i++){
        for(int j=N-1; j>=0; j--){
            int k = upper_bound(D.begin(), D.end(), D[j] / 2) - D.begin();
            while(2*D[k] > D[j]) k--;
            if(k < 0) dp[j] = 0;
            else dp[j] = dp[k];
        }
        for(int j=1; j<N; j++){
            dp[j] += dp[j-1];
            dp[j] %= MOD;
        }
    }
    cout << dp[N-1] << endl;
    return 0;
}

Submission Info

Judge Result