Buy and Resell
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
The Power Cube is used as a stash of Exotic Power. There are n cities numbered 1,2,…,n where allowed to trade it. The trading price of the Power Cube in the i-th city is ai dollars per cube. Noswal is a foxy businessman and wants to quietly make a fortune by buying and reselling Power Cubes. To avoid being discovered by the police, Noswal will go to the i-th city and choose exactly one of the following three options on the i-th day:
1. spend ai dollars to buy a Power Cube
2. resell a Power Cube and get ai dollars if he has at least one Power Cube
3. do nothing
Obviously, Noswal can own more than one Power Cubes at the same time. After going to the n cities, he will go back home and stay away from the cops. He wants to know the maximum profit he can earn. In the meanwhile, to lower the risks, he wants to minimize the times of trading (include buy and sell) to get the maximum profit. Noswal is a foxy and successful businessman so you can assume that he has infinity money at the beginning.
Input
There are multiple test cases. The first line of input contains a positive integer T (T≤250), indicating the number of test cases. For each test case:
The first line has an integer n. (1≤n≤105)
The second line has n integers a1,a2,…,an where ai means the trading price (buy or sell) of the Power Cube in the i-th city. (1≤ai≤109)
It is guaranteed that the sum of all n is no more than 5×105.
Output
For each case, print one line with two integers —— the maximum profit and the minimum times of trading to get the maximum profit.
Sample Input
3 4 1 2 10 9 5 9 5 9 10 5 2 2 1
Sample Output
16 4 5 2 0 0
Hint
In the first case, he will buy in 1, 2 and resell in 3, 4. profit = - 1 - 2 + 10 + 9 = 16 In the second case, he will buy in 2 and resell in 4. profit = - 5 + 10 = 5 In the third case, he will do nothing and earn nothing. profit = 0
题意:n个点有n!个排列组合的遍历方法,求遍历所有方法的距离
思路:算每一条边的贡献,一条边的左边和右边分别有a,b个点,那么这边的贡献就是2*a*b*len*(n-1)*(n-2)
这是为什么呢?
因为左边和右边有n*m种连接方法m*n也算 所以就有2*m*n种连接方法
然后将这两种连接方法绑定放入全排列插空
剩下(n-2)个节点全排列就是(n-2)! 有n-1个空可以插入
得证
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000+10;
const long long mod=1e9+7;
int vis[maxn],num[maxn],n;
vector<int>edg[maxn];
long long f[maxn];
struct node {int from,to,len;}zdy[maxn];
void dfs1(int now,int dep)
{
vis[now]=1;
num[now]=1;
for(int i=0;i<edg[now].size();i++)
{
if(!vis[edg[now][i]])
{
dfs1(edg[now][i],dep+1);
num[now]+=num[edg[now][i]];
}
}
}
int main()
{
f[0]=1;
for(int i=1;i<=100000;i++)
{
f[i]=(f[i-1]*i)%mod;
}
while(scanf("%d",&n)!=EOF)
{
memset(num,0,sizeof(num));
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)edg[i].clear();
for(int i=1;i<n;i++)
{
int t1,t2,t3;
scanf("%d%d%d",&t1,&t2,&t3);
zdy[i].from=t1;
zdy[i].to=t2;
zdy[i].len=t3;
edg[t1].push_back(t2);
edg[t2].push_back(t1);
}
dfs1(1,0);
long long ans=0;
for(int i=1;i<n;i++)
{
long long t1=num[zdy[i].from];
long long t2=num[zdy[i].to];
long long t3=zdy[i].len;
if(t1>t2)swap(t1,t2);
ans+=(((t1*(n-t1)*2*t3)%mod)*f[n-1])%mod;
ans%=mod;
}
printf("%lld\n",ans);
}
return 0;
}