HDU 5439 Aggregated Counting

题目：点击打开链接
题意：f(n)表示序列中n的最后的位置，求f（f(n)）。（哥伦布序列）

分析：原序列为1 2 2 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7，出现i次的数个数序列也为1 2 2 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7，最终发现f(f(n))=1 + (2+3)*2 + (4+5)*3 + (6+7+8)*4 + ... + (...+n)*t，t是远小于n的，预处理+二分即可。

代码：

#pragma comment(linker, "/STACK:102400000,102400000")
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<string>
#include<cstdio>
#include<bitset>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<set>
#include<map>
using namespace std;
#define debug test
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define inf 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
typedef pair<int,int> PII;
const ll mod = 1e9+7;
const int N = 1e6+10;

ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qp(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
int to[4][2]={{-1,0},{1,0},{0,-1},{0,1}};

ll t,n,a[N+10],sum[N+10],dp[N+10];

void init() {
    a[1] = 1,a[2] = a[3] = 2;
    int sz=3;
    for(int i=3; ; i++){
        int cnt = a[i];
        while(cnt--) {
            a[++sz] = i;
            if(sz>=N) break;
        }
        if(sz>=N) break;
    }
    for(int i=1; i<N; i++) sum[i] = sum[i-1]+a[i];
    for(int i=1;i<N;i++) dp[i] = (dp[i-1] + a[i]*i%mod*((2*sum[i]-a[i]+1)*qp(2,mod-2)%mod)%mod)%mod;
}

int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    init();
    scanf("%d",&t);
    while(t--){
        int n;
        scanf("%d",&n);
        int x=lower_bound(sum+1,sum+N+1,n)-sum;
        ll ans = dp[x-1];
        (ans += (n+sum[x-1]+1)*(n-sum[x-1])%mod*qp(2,mod-2)%mod*x%mod)%=mod;
        cout<<ans<<endl;
    }
    return 0;
}