elevator simulator

#include #include int main (){int n;int i,j;int num[101];while (1){int sum=0;memset (num,0,sizeof (num));scanf ("%d", n);if (n==0){Break}else{num[0]=0;for (i=1;i{scanf ("%d", num[i]);}for (i=0;i{if (num[i]{sum=sum+6* (Num[i+1]-num[i]) +5;}else if (num[i]>num[i+1])//Descent{sum=sum+4* (num[i]-num[i+1]) +5;}else if (num[i]==num[i+1]){sum=sum+5;}}printf ("%d\n", sum);}}return 0;}1, 2 times Submit are wrong answer, originally did not consider two times according to the same floor situation.Hangzhou

negative weights).As long as you can think of how to construct the algorithm. If your own algorithm, but do not know how to solve problems, it is useless. Here I would like to say to you,In the process of doing the problem later, do not just look at other people's code, to see the thought, why others write. Then write the code according to the thought of your imagination and write the process withoutLook at someone else's code. Even if it doesn't matter, this impression is the deepest, and late

/*ïâãæµä ½ê½êçí¨¹ýö±½ó²ùx÷¿âº¯êý ½ê½¶áè¡io*/#define KEY0 gpio_readinputdatabit (gpioe,gpio_pin_4)//pe4#define KEY1 gpio_readinputdatabit (gpioe,gpio_pin_3)//pe3#define KEY2 gpio_readinputdatabit (gpioe,gpio_pin_2)//pe2#define WK_UP gpio_readinputdatabit (GPIOA,GPIO_PIN_0)//pa0/*ïâãæ ½ê½êçí¨¹ýî»´ø²ùx÷ ½ê½¶áè¡io*//*#define KEY0 Pein (4)//pe4#define KEY1 Pein (3)//pe3#define KEY2 Pein (2)//P32#define WK_UP PAin (0)//pa0*/Total CONTACTOR PE5Safety Loop PE6Overhaul status PG6Brake Tile Temperature PG

Topic Pdf:http://acm.bnu.edu.cn/v3/external/124/12486.pdfApproximate test instructions: What is the number of sub-strings for Nth not containing "4" and "13", nIdea: is the general digital DP, two-point answer, the number of the answer to the number of DP figure out how many of the number of satisfied conditionsBut.... The answer to a long long, to use unsigned long long to be able to live, this pit point0 Ms 0 KB 2633 B 2015-08-15 01:02:36//#pragma comment (linker, "/stack:1024000000,1024000000

, such as two different knowledge reserves, hands-on ability differences, which will take a certain amount of time to achieve consensus. What we do is try to overcome these shortcomings at work and take advantage of the advantages of pairing programming to complete our projects faster and better.As we design our code, we are happy to use some language features and design methods to improve our code. For example, the full use of object-oriented language information hiding feature (information hid

Water problem not much said, elevator to go up also to come down so the highest layer multiplied by 10 is the time to go up and down, plus everyone out of the time, each person a second, how many different layers of how many times the door, time in different layers of superior to 5 can, the above time added is the total time. The code is attached: #include

#include Water problem, Vjudge on the elevator topic ....

ObjectiveThe small partners who have done the app test on iOS should know that the normal user installs the app from the AppStore, installs the test version of the app, is usually developed to the QR Code Scan code installation,or develop an. IPA installation package file, which is installed through itools. It's not that easy to install app testing on an iOS simulator for a small partner who doesn't have an iphone real-world device.First, start iOS Si

POJ 2392 Space ElevatorCows want to use c_i high h_i building blocks to build the tower, each kind of building blocks can not be higher than a_i, the maximum height of the towerThe a_i must be recursively pushed from small to large to cover the entire solution space. Multiple knapsack problem1Include2#include 3 using namespacestd;4 structnode5 {6 intH,maxn,n;7 };8Node a[516];9 intdp[516][40016];Ten BOOLIs_greater (Constnode A,Constnodeb) One { A returna.maxnB.MAXN; - } - intMain () the {

(); - for(inti =0; I ) { inscanf"%d%d%d", Hi + i, ai + i, CI +i); - } toSort (ran, ran +k,cmp); +dp[0] =1; - for(inti =0; I ) { the intt =Ran[i]; *memset (Used,0,sizeof(used)); $ for(inth = hi[t]; H ) {Panax Notoginseng //Dp[h]==0 must also remember to write, here is also a greedy - if(dp[h]==0dp[h-hi[t]] Used[h-hi[t]] +1Ci[t]) { theDP[H] =1; USED[H] = used[h-hi[t]] +1; + } A } the

Simple simulation. Pay attention to the situation where a [I] = A [I-1. # Include # Include # Include # Include # Include # Include Using Namespace STD; Const Int Maxn = 100 + 10 ; Int N, a [maxn]; Int Main () {scanf ( " % D " , N ); For ( Int I = 1 ; I " % D " , A [I]); [ 0 ] = 0 ; Int Ans = 0 ; For ( Int I = 1 ; I ){ If (A [I]> A [I- 1 ]) Ans = ans + (A [I]-A [I- 1 ]) * 6 , ANS = ans +5 ; Else If (A [I] 1 ]) Ans = ans + (A [I- 1 ]-A [I]) * 4 , ANS = ans + 5

Background: The weekly question was not read at the time. Even if you read it, you can only think of violence, not AC.Learning: 1. In the case of violent search timeouts, a good algorithm must be found, which is to look at the optimal solution with a similar trend of change rather than figure out the corresponding value for each floor and find the maximum value. Train of thought: Assume current floor below has N1 person, current floor has N2 person, current floor above has N3 person. Every step

This problem is very similar to coins, it seems that the building of the man eight questions is not simple.It would be nice to have a coins-style backpack.2392#include 1276#include POJ 2392 (Space Elevator) 1276 (Cash machine) warp backpack

Daily Simulator How to install local APK: 1, on your computer installed every day after the simulator software, your computer desktop will have a day simulator icon, double-click to open every day simulator software. 2, as shown in the following figure, this is the daily simula