JZOJ 4210. 【五校联考1day1】我才不是萝莉控呢
题目
分析
不懂 orz 哈夫曼树 合并果子???
50%
DP 50
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include<iostream> 2 #include<cstring> 3 using namespace std; 4 int a[100001],b[100001]; 5 int f[10001][10001]; 6 int main () 7 { 8 int T,n; 9 cin>>T; 10 for (int i=1;i<=T;i++) 11 { 12 cin>>n; 13 memset(f,0x3f,sizeof(f)); 14 for (int i=1;i<=n;i++) 15 cin>>a[i]; 16 b[n]=a[n]; 17 for (int i=n-1;i>=1;i--) 18 b[i]=b[i+1]+a[i]; 19 f[n][1]=0; 20 for (int i=n;i>=1;i--) 21 { 22 for (int j=1;j<=n;j++) 23 { 24 if (i+1<=n&&j-1>=1) f[i][j]=min(f[i][j],f[i+1][j-1]); 25 if (j*2-1<=n)f[i][j]=min(f[i][j],f[i][j*2-1]+b[i]); 26 if (j*2<=n) f[i][j]=min(f[i][j],f[i][j*2]+b[i]); 27 } 28 for (int j=n;j>=1;j--) 29 { 30 if (i+1<=n&&j-1>=1) f[i][j]=min(f[i][j],f[i+1][j-1]); 31 if (j*2<=n)f[i][j]=min(f[i][j],f[i][j*2]+b[i]); 32 if (j*2-1<=n) f[i][j]=min(f[i][j],f[i][j*2-1]+b[i]); 33 } 34 } 35 cout<<f[1][1]<<endl; 36 } 37 38 }
代码
1 #include <iostream> 2 #include <queue> 3 #include <cstdio> 4 using namespace std; 5 int T,n; 6 long long ans; 7 priority_queue<int,vector<int>,greater<int> >Q; 8 int main() 9 { 10 scanf("%d",&T); 11 while (T--) 12 { 13 scanf("%d",&n),ans=0; 14 for (int i=1,x;i<=n;i++) scanf("%d",&x),Q.push(x); 15 for (int i=n,x;i>1;i--) x=Q.top(),Q.pop(),x+=Q.top(),Q.pop(),ans+=x,Q.push(x); 16 printf("%lld\n",ans); 17 while (!Q.empty()) Q.pop(); 18 } 19 }
为何要逼自己长大,去闯不该闯的荒唐