青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

Problem G : Net Loss

Rose N. Blatt is designing an embedded neural network to place inside a cell phone. When trained by the phone’s
owner, the neural network will enable the user to dictate text messages in a hands-free way. The key idea in Rose’s
design is the use of complicated polynomial response functions in each of the nodes of the network (rather than the
more traditional thresholding functions used in many other neural nets). Figure 1 shows a portion of such a neural
network (the polynomials are not accurately graphed).
When Rose was ready to select her polynomials, she discovered a problem. Due to the limited amount of memory
available, she did not have enough space to store all of the coefficients of the polynomials in her network. She has
decided to use an approximation to each polynomial in the form of a continuous polygonal curve with two segments,
y = aB1Bx + aB0B and y = bB1Bx + bB0B. The segments meet at a point whose x-coordinate, c, is between -1 and +1. Rose wants
the approximation to be the best in the sense that the distance between p and the approximation function g is
minimal. We define the distance between p and g as the integral of the square of their difference:
For instance, if the polynomial is x^2-0.2, then the best polygonal approximation, with lines meeting at c = 0, is shown in Figure 2 (the dotted line shows the graph of the polygonal approximation).
In the few bytes that are available for each node, Rose can store the values of aB1B, aB0B, bB1B, bB0B, and c as signed numbers.
Fortunately Rose has a program that supplies her with a good guess for the value of c. Given this value, you are
asked to help Rose find the optimal values for aB1B, aB0B, bB1B, and bB0B in the approximations to her polynomials.

Input

The input file contains multiple test cases. Each test case consists of three lines. The first line contains a positive
integer n, 1 ≤ n ≤ 10, representing the degree of the polynomial p(x). This is followed by a line containing n +1
numbers between -1 and 1 inclusive, which are the coefficients of p(x) from highest order term down to the constant
term, expressed with at most three places after the decimal point. The last line for each test case contains the value
for c, -1 < c < 1, expressed with at most three places after the decimal point.

A line containing the integer zero follows the last test case.

Output

For each test case, print the case number (beginning with 1) and the four optimal values, displaying each with exactly
three places after the decimal point. The first and second values are the parameters a1 and a0 of the line segment
y = a1x + a0 defining g in the range -1 ≤ x ≤ c. The third and fourth values are the parameters b1 and b0 of the line
segment y = b1 + b0 defining g in the range c ≤ x ≤ 1. The distance d(p,g) between p and g (as defined earlier)
should be the minimum over all such choices for a1, a0, b1, and b0.

Sample Input

2
1.0 0.0 -0.2
0.0
3
1 0 -1 0
0.707
0

Output for the Sample Input

Case 1: -1.000 -0.367 1.000 -0.367
Case 2: -0.499 -0.036 1.198 -1.236

數學題,求函數g(x)里的常數項a0,a1,b0,b1,使得函數d(p,g)取得最值。
在推導出極值條件后,需要實現多項式求值,多項式乘法和多項式定積分3個函數,便能解決問題。

400027  2009-04-24 05:49:39 Accepted  0.002  Minimum  19193  C++  4124 - Net Loss
 1 #include <iostream>
 2 using namespace std;
 3 
 4 const int MAXPOW = 20;
 5 double a0,a1,b0,b1,A,B,C,D,E,F,G,H,I;
 6 struct poly{
 7     double c[MAXPOW];
 8     double value(double x) const{           //多項式求值
 9         double ans=0;
10         for(int i=MAXPOW-1;i>=0;i--)
11             ans=ans*x+c[i];
12         return ans;
13     }
14     poly operator * (const poly &p) const{  //多項式乘法
15         poly t;
16         for(int i=0;i<MAXPOW;i++)
17             for(int j=0;j<=i;j++)
18                 t.c[i]+=p.c[i-j]*c[j];
19         return t;
20     }
21     double integral(double a,double b) const{//定積分
22         poly t;
23         for(int i=1;i<MAXPOW;i++)
24             t.c[i]=c[i-1]/i;
25         return t.value(b)-t.value(a);
26     }
27     void clear(){
28         memset(c,0,sizeof(c));
29         }
30     poly(){
31         memset(c,0,sizeof(c));
32     }
33 }p,q;
34 int main(){
35     double c;
36     int i,n,ca=1;
37     while(scanf("%d",&n),n){
38         p.clear();
39         for(i=n;i>=0;i--) scanf("%lf",&p.c[i]);
40         scanf("%lf",&c);
41         q.c[1]=1,q.c[0]=-c;                 
42         A=p.integral(-1,c) , B=q.integral(-1,c) , C=(p*q).integral(-1,c) , D=(q*q).integral(-1,c);
43         E=p.integral(c,1) , F=q.integral(c,1) , G=(p*q).integral(c,1) , H=(q*q).integral(c,1);
44         I=2*(A+E-B*C/D-F*G/H);
45         a1=(C-I*B)/D , a0=I-c*a1 , b1=(G-I*F)/H , b0=I-c*b1;
46         printf("Case %d: %.3lf %.3lf %.3lf %.3lf\n",ca++,a1,a0,b1,b0);
47     }
48     return 0;
49 }

posted on 2009-04-24 14:05 極限定律 閱讀(1198) 評論(0)  編輯 收藏 引用 所屬分類: ACM-ICPC World Final 2008題解

<2025年9月>
31123456
78910111213
14151617181920
21222324252627
2829301234
567891011

導航

統計

常用鏈接

留言簿(10)

隨筆分類

隨筆檔案

友情鏈接

搜索

最新評論

閱讀排行榜

評論排行榜

青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品
  • <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            久久色在线观看| 欧美一级大片在线观看| 久久婷婷激情| 亚洲国产一成人久久精品| 欧美高清视频在线播放| 欧美 日韩 国产一区二区在线视频| 亚洲国产视频一区| 亚洲欧洲在线一区| 欧美日韩一二三四五区| 欧美一级免费视频| 久久亚洲精品网站| 国产精品99久久久久久久vr| 亚洲一区图片| 亚洲破处大片| 亚洲网在线观看| 在线观看亚洲精品视频| 亚洲美女91| 国产一区久久久| 亚洲三级免费观看| 国产亚洲一区二区三区在线播放| 蘑菇福利视频一区播放| 欧美视频一二三区| 欧美成人69av| 国产精品美女久久久久aⅴ国产馆| 久久综合国产精品| 国产精品久久久久一区二区三区| 免费91麻豆精品国产自产在线观看| 欧美日韩国产成人精品| 久久午夜av| 国产精品久久久久影院色老大| 欧美承认网站| 国产精品一区在线观看| 亚洲国产婷婷香蕉久久久久久99| 国产精品综合| 亚洲另类在线视频| 亚洲二区三区四区| 欧美一级视频| 亚洲欧美激情在线视频| 欧美精品在线一区二区| 欧美gay视频| 国产日韩一区二区三区| 夜夜夜精品看看| 亚洲激情亚洲| 久久亚洲精品中文字幕冲田杏梨| 久久激情视频| 国产精品视频九色porn| 日韩香蕉视频| 99国产精品99久久久久久| 久热精品视频在线观看一区| 欧美专区在线观看一区| 国产精品久久久久久久免费软件| 国产精品社区| 亚洲视频二区| 亚洲综合清纯丝袜自拍| 欧美日韩第一区日日骚| 亚洲国产美女精品久久久久∴| 在线观看av不卡| 久久九九免费| 免费观看一级特黄欧美大片| 激情久久久久久| 久久亚洲春色中文字幕| 老色鬼精品视频在线观看播放| 国产日韩一区在线| 欧美一区免费视频| 久久久精品动漫| 黄色成人av在线| 久久久蜜桃一区二区人| 欧美1区2区3区| 亚洲精品一区二区在线| 欧美成人有码| 99re6热在线精品视频播放速度| 999亚洲国产精| 欧美体内谢she精2性欧美 | 国产女优一区| 午夜在线观看免费一区| 麻豆精品视频| 亚洲九九精品| 国产精品视频福利| 久久久国产亚洲精品| 欧美福利电影网| 亚洲视频在线一区| 国产精品一区二区三区观看| 久久久免费av| 91久久线看在观草草青青| 亚洲性视频h| 好看不卡的中文字幕| 欧美精品日韩一区| 午夜精品久久久久久久久| 美女尤物久久精品| 一级成人国产| 国产综合第一页| 欧美va天堂va视频va在线| 在线亚洲一区观看| 美女主播精品视频一二三四| 一区二区三区欧美在线| 国内精品嫩模av私拍在线观看| 欧美sm视频| 久久国产精品久久久久久久久久| 亚洲国产精品成人一区二区| 午夜精品一区二区三区在线视| 亚洲二区在线视频| 国产精品你懂的在线欣赏| 久久亚洲私人国产精品va媚药 | 欧美一级在线播放| 亚洲精品国偷自产在线99热| 国产精品视频精品视频| 欧美日韩99| 乱人伦精品视频在线观看| 亚洲一区二区成人| 亚洲人成在线免费观看| 免费欧美电影| 久久国产精品99国产精| 亚洲天堂网在线观看| 在线观看一区二区精品视频| 国产精品永久免费视频| 免费久久99精品国产自在现线| 亚洲无人区一区| 日韩手机在线导航| 永久域名在线精品| 国产在线观看精品一区二区三区| 你懂的国产精品| 久久精品一区二区三区中文字幕| 艳妇臀荡乳欲伦亚洲一区| 欧美国产一区二区| 久久久久久欧美| 欧美在线视频一区二区| 午夜国产精品视频免费体验区| 亚洲精品在线视频观看| 亚洲国产婷婷香蕉久久久久久| 国产亚洲综合精品| 国产欧美日韩伦理| 国产精品视频在线观看| 国产精品裸体一区二区三区| 欧美日一区二区三区在线观看国产免| 麻豆九一精品爱看视频在线观看免费| 久久国产手机看片| 欧美在线三区| 久久婷婷人人澡人人喊人人爽| 欧美一区二区三区日韩| 欧美在线一二三| 欧美主播一区二区三区美女 久久精品人| 亚洲影院在线| 欧美一区午夜视频在线观看| 欧美在线观看视频在线| 久久久久国产精品一区二区| 久久精品国产69国产精品亚洲| 欧美一区二区视频在线观看2020| 欧美一区91| 久久久久久久网站| 欧美国产日韩免费| 欧美精品在欧美一区二区少妇| 欧美精品一区二区三区一线天视频| 欧美日韩成人一区二区| 国产精品欧美经典| 国语自产精品视频在线看抢先版结局| 国产视频欧美视频| 亚洲第一搞黄网站| 一本色道久久加勒比精品| 亚洲资源av| 久久天天躁狠狠躁夜夜av| 欧美激情精品久久久久久黑人| 亚洲欧洲日本国产| 亚洲一二三区精品| 久久成人免费日本黄色| 欧美激情日韩| 国产女人水真多18毛片18精品视频| 国产一区二区视频在线观看| 亚洲精选国产| 欧美一区二区女人| 欧美国产精品| 国产精品99久久99久久久二8| 欧美亚洲日本网站| 欧美成人免费网| 国产欧美日韩一级| 亚洲欧洲一区二区在线播放| 亚洲一区二区在线免费观看视频 | 欧美一区91| 欧美激情一区二区三区不卡| 一本一本大道香蕉久在线精品| 亚洲欧美一区二区原创| 欧美成人免费在线视频| 国产欧美日韩另类一区| 99国产精品视频免费观看| 久久精品道一区二区三区| 亚洲激情欧美激情| 久久精品理论片| 欧美特黄一级| 亚洲精品在线观| 久久精品国产清高在天天线| 亚洲久久一区二区| 久久青青草综合| 国产精品女人网站| 一区二区三区视频免费在线观看| 久久久999精品免费| 一区二区欧美亚洲| 女女同性女同一区二区三区91| 国产一区二区你懂的| 亚洲欧美日韩中文在线制服| 亚洲三级国产| 欧美成人免费全部观看天天性色|