« 問題描述： 假設(shè)要在足夠多的會(huì)場(chǎng)里安排一批活動(dòng)，并希望使用盡可能少的會(huì)場(chǎng)。設(shè)計(jì)一個(gè)有效的 貪心算法進(jìn)行安排。(這個(gè)問題實(shí)際上是著名的圖著色問題。若將每一個(gè)活動(dòng)作為圖的一個(gè) 頂點(diǎn)，不相容活動(dòng)間用邊相連。使相鄰頂點(diǎn)著有不同顏色的最小著色數(shù)，相應(yīng)于要找的最小 會(huì)場(chǎng)數(shù)。) « 編程任務(wù)： 對(duì)于給定的k個(gè)待安排的活動(dòng)，編程計(jì)算使用最少會(huì)場(chǎng)的時(shí)間表。 « 數(shù)據(jù)輸入： 由文件input.txt給出輸入數(shù)據(jù)。第一行有1 個(gè)正整數(shù)k，表示有k個(gè)待安排的活動(dòng)。接 下來的k行中，每行有2個(gè)正整數(shù)，分別表示k個(gè)待安排的活動(dòng)開始時(shí)間和結(jié)束時(shí)間。時(shí)間 以0 點(diǎn)開始的分鐘計(jì)。 « 結(jié)果輸出: 將編程計(jì)算出的最少會(huì)場(chǎng)數(shù)輸出到文件OUTput.txt。
標(biāo)簽： laquo
上傳時(shí)間： 2013-12-20
上傳用戶：LIKE
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points, data - matrix with data points, OUTput: R - rotation matrix and T - translation vector accordingly so newdata = R*data + T . newdata are transformed data points to fit model see help icp for more information
標(biāo)簽： points the minimize respect
上傳時(shí)間： 2014-01-02
上傳用戶：gyq
％ because we do not truncate and shift the convolved input ％ sequence, the delay of the desired OUTput sequence wrt ％ the convolved input sequence need only be the delay ％ introduced by the ideal weight vector centred at n=5
標(biāo)簽： the convolved truncate sequence
上傳時(shí)間： 2015-12-27
上傳用戶：www240697738
This example streams input from a ADC source to a DAC. An analog signal is acquired block-by-block into SDRAM from the ADC (an AD9244 in this example). The frames are then OUTput with a one-frame delay to the DAC (an AD9744 in this example). In this example, no processing is done on the frames. They are passed unaltered.
標(biāo)簽： block-by-block acquired example streams
上傳時(shí)間： 2015-12-29
上傳用戶：bjgaofei
最大流，The programs are designed to run under BSD UNIX. All programs read from the standard input and write to the standard OUTput. Run "make" to compile the programs and generators. File "list" lists the programs produced my "make". Input files are in DIMACS format. See sample.input.
標(biāo)簽：
上傳時(shí)間： 2015-12-30
上傳用戶：zhenyushaw
This program demonstrates operation of ADC0 in polled mode. The ADC0 is // configured to use writes to AD0BUSY as its start of conversion source and // to measure the OUTput of the on-chip temperature sensor. The temperature // sensor OUTput is converted to degrees Celsius and is transmitted out UART0
標(biāo)簽： ADC0 demonstrates configured operation
上傳時(shí)間： 2014-01-23
上傳用戶：wangyi39
This program demonstrates operation of ADC0 in polled mode. The ADC0 is // configured to use writes to AD0BUSY as its start of conversion source and // to measure the OUTput of the on-chip temperature sensor. The temperature // sensor OUTput is converted to degrees Celsius and is transmitted out UART0
標(biāo)簽： ADC0 demonstrates configured operation
上傳時(shí)間： 2014-08-18
上傳用戶：米卡
This directory contains the memtest 8051 firmware for the Anchor Chips EZ-USB chip. The purpose of this software is to test the different memory segments in the Ez-Usb chip. This example will OUTput the string "good" on the 7 segment LED if the mem test passes, or it will OUTput the first address where the memtest fails.
標(biāo)簽： directory the contains firmware
上傳時(shí)間： 2013-12-16
上傳用戶：gdgzhym
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then OUTput the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before OUTputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶：jeffery
EPS_Java Projec is JAVA program can display charts, and handle waypoints, track, and routes. It reads OUTput from the gpstrans program. gpstrans can communicate with Garmin GPS navigators.
標(biāo)簽： and waypoints EPS_Java display
上傳時(shí)間： 2016-01-22
上傳用戶：2404
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
