题目内容

下面程序段的所需要的计算时间为（）int MaxSum(int n, int *a, int &besti, int &bestj){int sum=0;for(int i=1;i<=n;i++){int thissum=0;for(int j=i;j<=n;j++){thissum+=a[j];if(thissum>sum){sum=thissum;besti=i;bestj=j;}}}return sum;}

查看答案

搜索结果不匹配？点我反馈

更多问题

当输入规模为n时，算法增长率最大的是（）

A. 5n
B. 20log2n
C. 2n2
D. 3nlog3n

He will make your dream ________ .

A. come true
B. comes true
C. coming true
D. to come true

He found his mobile phone ________ .

A. steal
B. being stealing
C. stolen
D. to steal

“Can’t you read?” Rose said ________ to the notice.

A. angrily pointing
B. and point angrily
C. angrily pointed
D. and angrily pointing