codeforces 894E - Ralph and Mushrooms tarjan缩点+数学+记忆化搜索找最长路

http://codeforces.com/problemset/problem/894/E
发份代码记录一下，思路很简单，tarjan缩点之后计算点权值记忆化搜索找最长路。
不过这个计算权值真的麻烦，推出的公式把long long 给爆了，debug了半天
(╥╯^╰╥)

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define ll long long
using namespace std;
const int INF = ( 2e9 ) + 2;
const ll maxn = 1e6+10;
struct edge
{
    int v;
    ll w;
    int next;
} e[maxn*2];
int head[maxn];
int tot;
int Belong[maxn],low[maxn],dfn[maxn];
bool Instack[maxn];
int index,scc;
stack<int> S;
vector<edge> g[maxn];
ll W[maxn],dp[maxn];
void init(int n)
{
    tot=index=scc=0;
    for(int i=1; i<=n; i++)
        g[i].clear();
    memset(head,-1,sizeof(head));
    memset(W,0,sizeof(W));
}
void add(int u,int v,ll w)
{
    e[tot].v=v;
    e[tot].w=w;
    e[tot].next=head[u];
    head[u]=tot++;
}
void tarjan(int u)
{
    low[u]=dfn[u]=++index;
    S.push(u);
    Instack[u]=true;
    for(int i=head[u]; i!=-1; i=e[i].next)
    {
        int v=e[i].v;
        if(!dfn[v])
        {
            tarjan(v);
            low[u]=min(low[u],low[v]);
        }
        else if(Instack[v])
            low[u]=min(low[u],low[v]);
    }
    if(low[u]==dfn[u])
    {
        scc++;
        int x;
        do
        {
            x=S.top();
            S.pop();
            Instack[x]=false;
            Belong[x]=scc;
        }
        while(x!=u);
    }
}
ll dfs(int u)
{
    if(dp[u]>0)return dp[u];
    for(int i=0,L=g[u].size(); i<L; i++)
    {
        int v=g[u][i].v;
        ll w=g[u][i].w;
        dp[u] = max(dp[u],dfs(v)+w);
    }
    dp[u]+=W[u];
    return dp[u];
}
ll solve(int n,int st)
{
    for(int i=1; i<=n; i++)
        if(!dfn[i])tarjan(i);
    for(int i=1; i<=n; i++)
    {
        for(int j=head[i]; j!=-1; j=e[j].next)
        {
            int v=e[j].v;
            if(Belong[i]!=Belong[v])
                g[Belong[i]].push_back(edge {Belong[v],e[j].w});
            else
            {
                int id=Belong[i];
                ll n = int((-1+sqrt(1+8*e[j].w))/2);
                unsigned long long temp=(3LL*n*n+2LL*n+n*n*n*1LL)/6LL;
                W[id] += 1LL*e[j].w*(n+1) - temp;
            }
        }
    }
    ll ans=0;
    for(int i=1; i<=scc; i++)
        if(!dp[i])
        {
            dfs(i);
        }
    return dp[Belong[st]];
}
int main()
{
    int n,m,u,v;
    ll w;
    scanf("%d%d",&n,&m);
    init(n);
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d%I64d",&u,&v,&w);
        add(u,v,w);
    }
    int start;
    scanf("%d",&start);
    printf("%I64d\n",solve(n,start));
}