Submission #1152815

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <time.h>
#include <random>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
long long ans[4][200000] = {};
long long counte[4][200000] = {};
int main() {
	int n;
	cin >> n;
	vector<int> a;
	REP(i, n) {
		int tmp;
		cin >> tmp;
		counte[3][tmp]++;
		a.push_back(tmp);
	}
	long long hogee = 0;
	for (int i = 0;i < 120000;++i) {
		hogee += counte[3][i];
		ans[3][i] = hogee;
	}
	sort(a.begin(), a.end());
	for (int i = 2;i >= 0;--i) {
		for (int q = 0;q < a.size();++q) {
			long long hoge = ans[i + 1][110000] - ans[i + 1][(a[q] * 2) - 1];
			while (hoge <= 0) {
				hoge += MAX_MOD;
			}
			hoge %= MAX_MOD;
			counte[i][a[q]] += hoge;
			counte[i][a[q]] %= MAX_MOD;
		}
		long long aaa = 0;
		for (int q = 0;q < 120000;++q) {
			aaa += counte[i][q];
			aaa %= MAX_MOD;
			ans[i][q] = aaa;
		}
	}
	if (ans[0][110000] < 0) {
		int tmp= a[0];
		for (int i = 0;i >= 0;++i) {
			tmp += i;
		}
	}
	cout << ans[0][110000] << endl;
	return 0;
}

Submission Info

Judge Result