亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲(chóng)蟲(chóng)首頁(yè)| 資源下載| 資源專(zhuān)輯| 精品軟件
登錄| 注冊(cè)

time-Series

  • RTX-51 Real-Time(漢).pdf

    RTX-51 Real-Time(漢).pdf

    標(biāo)簽: Real-Time RTX 51

    上傳時(shí)間: 2016-04-04

    上傳用戶(hù):lizhizheng88

  • 算法導(dǎo)論英文版 This book is one of a series of texts written by faculty of the Electrical Engineering and

    算法導(dǎo)論英文版 This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. I

    標(biāo)簽: Engineering Electrical of faculty

    上傳時(shí)間: 2016-04-07

    上傳用戶(hù):123456wh

  • The OpenGPSRec receiver software runs on the real time operating system RTAI-Linux. It compiles with

    The OpenGPSRec receiver software runs on the real time operating system RTAI-Linux. It compiles with gcc using a RTAI-patched linux kernel. linux下的GPS 開(kāi)放源碼~!

    標(biāo)簽: OpenGPSRec RTAI-Linux operating receiver

    上傳時(shí)間: 2016-04-10

    上傳用戶(hù):xc216

  • pcf8593實(shí)時(shí)時(shí)鐘的驅(qū)動(dòng)實(shí)例 Real Time Clock interface for Linux on CPE with FTRTC010

    pcf8593實(shí)時(shí)時(shí)鐘的驅(qū)動(dòng)實(shí)例 Real Time Clock interface for Linux on CPE with FTRTC010

    標(biāo)簽: interface Clock Linux FTRTC

    上傳時(shí)間: 2013-12-01

    上傳用戶(hù):牧羊人8920

  • Problem D:合唱隊(duì)形 Time Limit:1000MS Memory Limit:65536K Total Submit:1237 Accepted:437 Language

    Problem D:合唱隊(duì)形 Time Limit:1000MS Memory Limit:65536K Total Submit:1237 Accepted:437 Language: not limited Description N位同學(xué)站成一排,音樂(lè)老師要請(qǐng)其中的(N-K)位同學(xué)出列,使得剩下的K位同學(xué)排成合唱隊(duì)形。 合唱隊(duì)形是指這樣的一種隊(duì)形:設(shè)K位同學(xué)從左到右依次編號(hào)為1,2…,K,他們的身高分別為T(mén)1,T2,…,TK, 則他們的身高滿(mǎn)足T1 < T2 < ...< Ti > Ti+1 > … >TK(1<=i<=K)。 你的任務(wù)是,已知所有N位同學(xué)的身高,計(jì)算最少需要幾位同學(xué)出列,可以使得剩下的同學(xué)排成合唱隊(duì)形。 Input 輸入包含若干個(gè)測(cè)試用例。 對(duì)于每個(gè)測(cè)試用例,輸入第一行是一個(gè)整數(shù)N(2<=N<=100),表示同學(xué)的總數(shù)。第二行有N個(gè)整數(shù),用空格分隔,第i個(gè)整數(shù)Ti(130<=Ti<=230)是第i位同學(xué)的身高(厘米)。當(dāng)輸入同學(xué)總數(shù)N為0時(shí)表示輸入結(jié)束。 Output 對(duì)于每個(gè)測(cè)試案例,輸出包括一行,這一行只包含一個(gè)整數(shù),就是最少需要幾位同學(xué)出列。 Sample Input 8 186 186 150 200 160 130 197 220 3 150 130 140 0 Sample Output 4 1

    標(biāo)簽: Limit Accepted Language Problem

    上傳時(shí)間: 2014-01-13

    上傳用戶(hù):aappkkee

  • Problem F:汽車(chē)加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language

    Problem F:汽車(chē)加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Description 一輛汽車(chē)加滿(mǎn)油后可行駛n公里。旅途中有若干個(gè)加油站。設(shè)計(jì)一個(gè)有效算法,指出應(yīng)在哪些加油站停靠加油,使沿途加油次數(shù)最少。 編程任務(wù): 對(duì)于給定的n和k(k <= 10000)個(gè)加油站位置,編程計(jì)算最少加油次數(shù)。 Input 第一行有2 個(gè)正整數(shù)n和k,表示汽車(chē)加滿(mǎn)油后可行駛n公里,且旅途中有k個(gè)加油站。接下來(lái)的1 行中,有k+1 個(gè)整數(shù),表示第k個(gè)加油站與第 k-1 個(gè)加油站之間的距離。第0 個(gè)加油站表示出發(fā)地,汽車(chē)已加滿(mǎn)油。第k+1 個(gè)加油站表示目的地。 Output 輸出最少加油次數(shù)。如果無(wú)法到達(dá)目的地,則輸出”No Solution”。 Sample Input 7 7 1 2 3 4 5 1 6 6 Sample Output 4

    標(biāo)簽: Limit Accepted Language Problem

    上傳時(shí)間: 2016-04-12

    上傳用戶(hù):youth25

  • Fast settling-time added to the already conflicting requirements of narrow channel spacing and low

    Fast settling-time added to the already conflicting requirements of narrow channel spacing and low phase noise lead to Fractional4 divider techniques for PLL synthesizers. We analyze discrete "beat-note spurious levels from arbitrary modulus divide sequences including those from classic accumulator methods.

    標(biāo)簽: settling-time requirements conflicting already

    上傳時(shí)間: 2016-04-14

    上傳用戶(hù):liansi

  • Apache 2.0.63 is the current stable version of the 2.0 series, and is recommended over any previous

    Apache 2.0.63 is the current stable version of the 2.0 series, and is recommended over any previous 2.0 release. This release fixes a few potential security vulnerabilites.

    標(biāo)簽: recommended the previous current

    上傳時(shí)間: 2016-04-14

    上傳用戶(hù):hullow

  • The second volume in the Write Great Code series supplies the critical information that today s comp

    The second volume in the Write Great Code series supplies the critical information that today s computer science students don t often get from college and university courses: How to carefully choose their high-level language statements to produce efficient code. Write Great Code, Volume 2: Thinking Low-Level, Writing High-Level, teaches software engineers how compilers translate high-level language statements and data structures into machine code. Armed with this knowledge, a software engineer can make an informed choice concerning the use of those high-level structures to help the compiler produce far better machine code--all without having to give up the productivity and portability benefits of using a high-level language

    標(biāo)簽: information the critical supplies

    上傳時(shí)間: 2014-02-21

    上傳用戶(hù):luke5347

  • Real Time OS 教學(xué)資料

    Real Time OS 教學(xué)資料

    標(biāo)簽: Real Time OS

    上傳時(shí)間: 2016-04-25

    上傳用戶(hù):ryb

主站蜘蛛池模板: 台北市| 九台市| 临邑县| 当涂县| 全椒县| 仙游县| 信宜市| 闽清县| 襄汾县| 梅州市| 余姚市| 道孚县| 阿拉善右旗| 黄石市| 司法| 五指山市| 崇文区| 迁西县| 怀集县| 睢宁县| 天台县| 扬州市| 准格尔旗| 凤冈县| 商城县| 乐平市| 资中县| 长治县| 慈利县| 祁门县| 海丰县| 怀集县| 历史| 合肥市| 留坝县| 长宁区| 文昌市| 固镇县| 万盛区| 武宣县| 大方县|