hdu5734

Problem Description

Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular type of DNN, known as Convolutional Neural Networks (CNN), have demonstrated state-of-the-art results in object recognition and detection.

Convolutional neural networks show reliable results on object recognition and detection that are useful in real world applications. Concurrent to the recent progress in recognition, interesting advancements have been happening in virtual reality (VR by Oculus), augmented reality (AR by HoloLens), and smart wearable devices. Putting these two pieces together, we argue that it is the right time to equip smart portable devices with the power of state-of-the-art recognition systems. However, CNN-based recognition systems need large amounts of memory and computational power. While they perform well on expensive, GPU-based machines, they are often unsuitable for smaller devices like cell phones and embedded electronics.

In order to simplify the networks, Professor Zhang tries to introduce simple, efficient, and accurate approximations to CNNs by binarizing the weights. Professor Zhang needs your help.

More specifically, you are given a weighted vector  W=(w1,w2,...,wn). Professor Zhang would like to find a binary vector  B=(b1,b2,...,bn)  (bi∈{+1,−1})and a scaling factor  α≥0 in such a manner that  ∥W−αB∥2 is minimum.

Note that  ∥⋅∥ denotes the Euclidean norm (i.e.  ∥X∥=x21+⋯+x2n−−−−−−−−−−−√, where  X=(x1,x2,...,xn)).

 

Input

There are multiple test cases. The first line of input contains an integer  T, indicating the number of test cases. For each test case:

The first line contains an integers  n  (1≤n≤100000) -- the length of the vector. The next line contains  n integers:  w1,w2,...,wn  (−10000≤wi≤10000).

 

Output

For each test case, output the minimum value of  ∥W−αB∥2 as an irreducible fraction " p/ q" where  p,  q are integers,  q>0.

 

Sample Input

3 4 1 2 3 4 4 2 2 2 2 5 5 6 2 3 4

 

Sample Output

5/1 0/1 10/1

官方题解：

展开式子, \left| W-\alpha B \right|^2=\displaystyle\alpha^2\sum_{i=1}^{n}b_i^2-2\alpha\sum_{i=1}^n{w_ib_i}+\sum_{i=1}^{n}w_i^2∥W−αB∥​2​​=α​2​​​i=1​∑​n​​b​i​2​​−2α​i=1​∑​n​​w​i​​b​i​​+​i=1​∑​n​​w​i​2​​.

由于b_i\in {+1,-1}b​i​​∈{+1,−1}, 那么\displaystyle\sum_{i=1}^{n}b_i^2=n​i=1​∑​n​​b​i​2​​=n, 显然c=\displaystyle\sum_{i=1}^{n}w_i^2c=​i=1​∑​n​​w​i​2​​也是常数. 转化成求\displaystyle\alpha^2n-2\alpha\sum_{i=1}^n{w_ib_i}+cα​2​​n−2α​i=1​∑​n​​w​i​​b​i​​+c的最小值. 对于固定的$\alpha >0$, 只要\displaystyle\sum_{i=1}^n{w_ib_i}​i=1​∑​n​​w​i​​b​i​​最大就好了. 显然b_i=sign(w_i)b​i​​=sign(w​i​​)的时候, \displaystyle\sum_{i=1}^n{w_ib_i}=\sum_{i=1}^{n}|w_i|​i=1​∑​n​​w​i​​b​i​​=​i=1​∑​n​​∣w​i​​∣最大. 进一步的, 上面显然是一个关于$\alpha$的二次方程, 于是当\alpha=\frac{1}{n}\displaystyle\sum_{i=1}^n{w_ib_i}=\frac{1}{n}\displaystyle\sum_{i=1}^{n}{|w_i|}α=​n​​1​​​i=1​∑​n​​w​i​​b​i​​=​n​​1​​​i=1​∑​n​​∣w​i​​∣时, 取到最大值.

化简下, 可以得到最小值是\sum_{i=1}^n{w_i^2}-\frac{1}{n}(\displaystyle\sum_{i=1}^{n}|w_i|)^2∑​i=1​n​​w​i​2​​−​n​​1​​(​i=1​∑​n​​∣w​i​​∣)​2​​

其实就是求方差和

sum:(ai-ave)^2/n，因为要求输出分数，所以把ave=sum/n乘以n倍，其他同变化，分子展开化简可得（ai^2和-sum^2)/n，再利用gcd化简为最简分式就好

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<sstream>
#include<iostream>
#include<cmath>
#include<queue>
#include<map>
using namespace std;

long long gcd(long long x,long long y){
	if(y==0) return x;
	return gcd(y,x%y);
}

int main(){
	freopen("input.txt","r",stdin);
	int t;
	long long a[100000+5];
	cin>>t;
	while(t--){
		memset(a,0,sizeof(a));
		int n;
		long long rel=0;
		long long sum=0;
		cin>>n;
		for(int i=0;i<n;i++){
			scanf("%lld",&a[i]);
			if(a[i]<0) a[i]=-a[i];
			sum+=a[i];
			rel+=a[i]*a[i];
		}
		rel*=n;
		rel-=sum*sum;
		long long GCD=gcd(rel,n);
		rel/=GCD;
		n/=GCD;
		cout<<rel<<"/"<<n<<endl;
	}
	return 0;
}