hdu-5734 Acperience(数学)
2016-07-21 19:19
302 查看
题目链接:
Memory Limit: 65536/65536 K (Java/Others)
[align=left]Problem Description[/align]
[align=left] [/align]
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)).
[align=left]Input[/align]
[align=left] [/align]
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).
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left] [/align]
3
4
1 2 3 4
4
2 2 2 2
5
5 6 2 3 4
[align=left]Sample Output[/align]
[align=left] [/align]
5/1
0/1
10/1
题意:
问∑(w[i]+x[i]*a)^2最小是多少?x[i]=1或-1;a>0;
思路:
∑(w[i]+x[i]*a)^2=∑w[i]^2+n*a^2+2*a*∑x[i]w[i];
∑w[i]^2是常数,现在变成了一个一元二次函数,找出它的最小值;
根据二次函数的的性质,∑x[i]w[i]尽量大,所以就很简单了;
AC代码:
Acperience
Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)
[align=left]Problem Description[/align]
[align=left] [/align]
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)).
[align=left]Input[/align]
[align=left] [/align]
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).
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
[align=left] [/align]
3
4
1 2 3 4
4
2 2 2 2
5
5 6 2 3 4
[align=left]Sample Output[/align]
[align=left] [/align]
5/1
0/1
10/1
题意:
问∑(w[i]+x[i]*a)^2最小是多少?x[i]=1或-1;a>0;
思路:
∑(w[i]+x[i]*a)^2=∑w[i]^2+n*a^2+2*a*∑x[i]w[i];
∑w[i]^2是常数,现在变成了一个一元二次函数,找出它的最小值;
根据二次函数的的性质,∑x[i]w[i]尽量大,所以就很简单了;
AC代码:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <bits/stdc++.h> #include <stack> using namespace std; #define For(i,j,n) for(int i=j;i<=n;i++) #define mst(ss,b) memset(ss,b,sizeof(ss)); typedef long long LL; template<class T> void read(T&num) { char CH; bool F=false; for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar()); for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar()); F && (num=-num); } int stk[70], tp; template<class T> inline void print(T p) { if(!p) { puts("0"); return; } while(p) stk[++ tp] = p%10, p/=10; while(tp) putchar(stk[tp--] + '0'); putchar('\n'); } const LL mod=1e9+7; const double PI=acos(-1.0); const int inf=1e9; const int N=1e5+10; const int maxn=500+10; const double eps=1e-6; int a ,n; LL sum=0,ans=0; LL gcd(LL x,LL y) { if(y==0)return x; return gcd(y,x%y); } int main() { int t; read(t); while(t--) { read(n); sum=0,ans=0; For(i,1,n) { read(a[i]); sum=sum+(LL)a[i]*a[i]; if(a[i]<0)ans=ans-a[i]; else ans=ans+a[i]; } LL x=(LL)n; LL g=gcd(x*sum-ans*ans,x); cout<<(x*sum-ans*ans)/g<<"/"<<x/g<<endl; } return 0; }
相关文章推荐
- UITableView 横向滚动(一)
- Java自带的性能监测工具用法简介——jstack、jconsole、jinfo、jmap、jdb、jsta、jvisualvm
- 基础练习二 (12道)
- Android进程间通讯——多进程共用SharedPreferences
- 2016 Multi-University Training Contest 2 1009 It's All In The Mind
- insmod等模块命令
- Redis的info参数简介
- Android进程间通讯——多进程共用SharedPreferences
- 1085. Perfect Sequence (25)-PAT甲级真题
- 转:设置图片透明的四种方法
- lombok
- JAVA网络通讯
- 求两个节点的最近公共祖先节点
- 做dg备库执行duplicate target database for standby nofilenamecheck报RMAN-06023
- CodeForces 599B Spongebob and Joke【思维】
- 关于Xutils框架出现无法访问HttpRequestBase 找不到org.apache.http.client.methods.H...
- 1074. Reversing Linked List (25)-PAT甲级真题
- 拼图游戏的制作
- 一步一图一代码,一定要让你真正彻底明白红黑树 (July算法!!!)
- Codeforces New Year and Days