hdu5734
来源:互联网 发布:易店淘宝店铺买卖骗局 编辑:程序博客网 时间:2024/05/17 07:28
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 vectorW=(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) ).
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
Note that
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 integersn (1≤n≤100000) -- the length of the vector. The next line contains n integers: w1,w2,...,wn (−10000≤wi≤10000) .
The first line contains an integers
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
341 2 3 442 2 2 255 6 2 3 4
Sample Output
5/10/110/1
官方题解:
展开式子, ∥W−αB∥2=α2i=1∑nbi2−2αi=1∑nwibi+i=1∑nwi2.
由于bi∈{+1,−1}, 那么i=1∑nbi2=n, 显然c=i=1∑nwi2也是常数. 转化成求α2n−2αi=1∑nwibi+c的最小值. 对于固定的α>0, 只要i=1∑nwibi最大就好了. 显然bi=sign(wi)的时候, i=1∑nwibi=i=1∑n∣wi∣最大. 进一步的, 上面显然是一个关于α的二次方程, 于是当α=n1i=1∑nwibi=n1i=1∑n∣wi∣时, 取到最大值.
化简下, 可以得到最小值是∑i=1nwi2−n1(i=1∑n∣wi∣)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;}
0 0
- hdu5734
- HDU5734 Acperience
- HDU5734 Acperience
- hdu5734 Acperience(数学)
- hdu5734 Acperience(数学)
- hdu5734 推公式 多校2.1
- HDU5734(二次函数最值)
- hdu5734——Acperience(数学推导)
- (多校第二场1001)HDU5734 Acperience
- 【HDU5734 2016 Multi-University Training Contest 2A】【公式代入推导】Acperience n维向量各有加减最小模长
- 指针的指针的理解以及应用
- linux 信号的使用
- mq基础知识
- Java学习-循环(for)
- hdoj-1722-Cake
- hdu5734
- LINUX-内核-中断分析-中断向量表(3)-arm
- JavaScript的BOM对象
- PAT-B 1022. D进制的A+B
- Maven将依赖打入jar包
- hdoj-1597-find the nth digit
- 扫描自己进入VR中 SLAM Scan 3D引擎将做到
- 平滑处理
- JVM相关