һ - רҵ·ĵϷƽ̨

2018年上半年软件设计师下午卷精彩试题及问题详解解析汇?- 百度文库

Դû ʱ䣺2025/6/4 11:55:36 loading ƪĵֻ
˵ݽԤݿܲȫҪĵҪݣwordʹáword΢ź:xxxxxxxQQxxxxxx ܸṩĵл֧½⡣

ʵĵ

15 ֣

Ķ˵ش 1 3ֽĶӦڡ ˵

ij ETC Electronic Toll Collectionͣշѣϵͳڸٹ·ߵضλһ·Ͽյżܣ Toll gantryż° 6 Trafic lanesÿϰװ״ﴫ Radar sensorߴ Radio transceiver Digital Cameraڲͣշѵ豸ʻٶµշѹϵͳĻ£

1ÿϰװгʻԱ DriverһžΨһʶĴſ복СſлмʻԱ˻ĵǰü¼

2ͨijʱͣշ豸ʶڵб룬жϳͣ ռϢ͵·ϵͳ Regional centerУͨзôշѽף TransactionӼʻԱר˻п۳ͨзáʻԱ˻͸֧¼͸֧˻Ϣϵͳٽ׺˻Ϣ͵άʻԱ Ϣϵͳ Central system

3еĴſʹʾֵĸгֵֵϢᴫϵͳ Ը¼ʻԱ˻

4ûаװ߳ϵijͨʱϵԳգƬʱ䷢͵ϵͳ¼ʧܵĽϢýϢ͵ϵͳ

5ϵͳȡͣշ豸¼Ľͨ¼ Traffic eventsͨ㲥̨ Traffic advice centerЩͨ¼·· ֲ󷽷ϵͳзƣõ 31 ʾбԼͼ 31 ʾͼͼ 32 ʾķͼ

ʵĵ

14 ֣

˵еͼ 31 A1A4 ӦIJơ 25 ֣

˵е 31ͼ 31 UIU5 Ӧơ 36 ֣

˵еͼ 32 C1~C6 Ӧ

ʵĵ

ģ 15 ֣

Ķ˵ C 룬ش 1 2ֽĶӦڡ ˵

ij˾򳤸игۡиijɱԺԲƣijΪӢ硣֪۸ P Pii12...mʾΪ i Ӣĸļ۸Ҫʹи и㷨˼£

賤ijΪ n Ӣ磬ииγΪ i Ӣ磬ʣ೤Ϊ ni Ӣипܵ iõ rn ӦиΪиrn ĵݹ鶨£ rn =max1 i n(pi +rn-i)

Դ˵ݹʽԶºԵʵַʽ C 롿 /*ͱ˵

nij P[]۸ */

#define LEN 100

int TopDown Cut_Rod(int P[]int n)/*Զ*

Int r=0 Int i if(n=0){

retum 0 }

for(i=11i++){

int tmp=p[i]+Top_Down_ Cut_Rod(pn-i) r=(r>=tmp)?rtmp

ʵĵ

}

return r }

int Bottom_Up_Cut_Road(int p[],int n){ /*Ե*/ int r[LEN]={0}; int temp=0; int i,j;

for(j=1;j<=n;j++){ temp=0;

for(i=l;(2);i++){ temp=(3); } 4 }

return r[n]; }

18 ֣

˵ C еĿգ14 27 ֣

˵ C 룬㷨õΪ5

ʱԶ·ʱ临ӶΪ6ԵϷʱ临ӶΪ7 O ʾ

е 2 ()ѡ 1 ڴֽϵָλôѡſͿڡͿδͿſ,Сһ֡

( 15 )

Ķ˵ C++,Ӧ(n)־дڴֽĶӦڡ ˵

( Builder)ģʽͼǽһӶĹıʾ,ʹͬ

2018年上半年软件设计师下午卷精彩试题及问题详解解析汇?- 百度文库.doc ĵWordĵصԣ㸴ơ༭ղغʹӡ
Ƽ
Copyright © 2012-2023 һ Ȩ | ϵ
:վز֪ʶȨݡϢ紫ȨתصƷַȨ,һ֪ͨǣǻἰʱɾ
ͷQQxxxxxx 䣺xxxxxx@qq.com
ICP2023013149
Top