HDU 5139 离线暴力

//HDU_5139.cpp
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <climits>
#include <cctype>
#include <algorithm>
#include <iostream>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <queue>
#include <utility>
#include <vector>
#include <bitset>
#include <functional>
using namespace std;
typedef long long love_live;
//const double pai = acos(-1.0);
const double pai = 3.14159265358979323846;
const int INF = 0x3f3f3f3f;
const love_live mod = 1000000007;
struct num
{
	love_live id, val, ans;
};

num input_arr[100117];
love_live in_num = 0;

void init()
{
	memset(input_arr, 0, sizeof(input_arr));
	in_num = 0;
return ;
}

bool cmp1(num a, num b)
{
	return a.val < b.val;
}

bool cmp2(num a, num b)
{
	return a.id < b.id;
}

int main(int argc, char const *argv[]) 
{
#ifndef ONLINE_JUDGE
//	freopen("output", "w", stdout);
	freopen("input", "r", stdin);
#endif
	love_live n, m, i, j, k;
	init();
	while(cin >> n)
	{
		input_arr[in_num].id = in_num;
		input_arr[in_num++].val = n;
	}
	sort(input_arr, input_arr + in_num, cmp1);
	love_live fraction_pos = 1;
	love_live fn = 1;
	love_live product = 1;
	for(i = 0; i < in_num; ++i)
	{
		if(input_arr[i].val == 1)
		{
			input_arr[i].ans = 1;
			continue;
		}
		if(fraction_pos < input_arr[i].val)
		{
			for(j = fraction_pos + 1; j <= input_arr[i].val; ++j)
			{
				product *= j;
				product %= mod;
				fn *= product;
				fn %= mod;
			}
			input_arr[i].ans = fn % mod;
			fraction_pos = input_arr[i].val;
		}
		else if(fraction_pos == input_arr[i].val)
		{
			fn %= mod;
			input_arr[i].ans = input_arr[i - 1].ans;
		}
	}
	sort(input_arr, input_arr + in_num, cmp2);
	for(i = 0; i < in_num; ++i)
	{
		cout << input_arr[i].ans << endl;
	}
return 0;
}