st math3

St-link in the Win8 on the support is not very good, it is said that because St-link the hardware does not have a digital signature, Win8 mandatory hardware must have a digital signature. Although the usual still use of pirated Jlink a little more, but the hands of this piece of Discovery Board only onboard St-link . Download ZadigDownload First Zadig , this is

#1068: Rmq-st algorithm time limit: 10000ms single point time: 1000ms memory limit: 256MB descriptionLittle Hi and Little Ho have traveled in the United States for quite a long time and are finally ready to return home! And before returning home, they are going to the supermarket to buy some local specialties-such as Hamburg (fog) and so on to return home.But after the supermarket, Little Hi and the small ho found the supermarket has too many kinds of

occurrence of the position is: pos[7] = 5, pos[5] = 10;(2) Get P sequence [5, 10] This satin sequence s:7 4 8 4 1 5(3) The smallest point in the s sequence, i.e. node 1, is the LCA of node 7 and node 5 we are looking for.Notice that the S sequence at this time is not a shortest path from node 7 to node 5, it contains some other nodes in addition to the nodes on the shortest path of 7 to 5, but these other nodes are nodes on the subtree rooted in Node 1, their depth is greater than the node 1, D

"RMQ" range minimum/maximum Query range max problem"St Algorithm"An effective algorithm for solving RMQ problems　　　　pretreatment pre-treatment to construct D, preprocessing time complexity O (NLOGN)Using the idea of dynamic programming D (I, j) indicates that the minimum value of the range I ~ i + 2j-1 has a state transition equation　　D (i, j) = min {d (i, j-1), D (i + 2j-1, j-1)}　　Set the original data stored in the array a[], the initial stateD (i,

This algorithm can be used to deal with the interval maximum problem, the preprocessing time is O (nlogn), the query time is O (1)This algorithm is mainly based on the multiplication idea, using the array st[i][j] to indicate the maximum value of the J-th square that starts to search backwards from the first element I 2Available in recursive way:St[i][j]=min/max (st[i][j-1],

After dinner at noon on October 11, March 17, the street was very busy and the sky was still raining. The street was holding a parade. I don't know what holiday it was. No matter what it was, take some photos first. It is very interesting, enthusiastic, and has a strong holiday color.The streets and lanes are crowded with people. The streets in the central region of the city are crowded with green clothes and green ornaments. Even many bars sell Green-colored green beer on the day. Therefore, yo

Click to open linkBalanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 36215 Accepted: 16954 Case Time Limit: 2000MS DescriptionFor the daily milking, Farmer John's n cows (1≤ n ≤50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate frisbee with some of the cows. To keep things simple, he'll take a contiguous range of cows from the milking lineup to

One: OUT/OUT_T/OUT_C/OUT_C-C32Description: Simple Shun control instructions do not do other instructions.Control requirements : NoneProgramming Ladder diagram:Structured Programming St Language:(*out (en,d); *) Out (m9,m408);(* Substituting statement m408:=m9;*) M409:=not M10; (* Substituting statement out (not m10,m409) *) out (m11,m411); M412:=m11;out (m12,d0.0);(*out_t (en,tcoil,tvalue) *) out_t (m13,tc1,100); out (ts1,m413);(*out_c (en,ccoil,cvalu

RMQ problem: For a sequence of length n, find the direct value of [i,j].St algorithm: A method of dynamic programming.Pre-processing of DP arraysFor the maximum value of the interval [i,i+2^j-1], you only need to know the maximum of the interval [i,i+2^ (j-1)-1] and the interval [i+2^ (j-1), i+2^j-1].The recursive equation is: dp[i,i+2^j-1] = max (dp[i,i+2^ (j-1) -1],dp[i+2^ (j-1), i+2^j-1])But for a relatively long sequence, 2^j is a very large numbe

We really need to extend the ST algorithm to two-dimensional, because the two-dimensional rmq problem is still a lot ofint n,b,k; int mm[505]; int VAL[MAXN][MAXN]; int dpmin[maxn][maxn][8[8]; int dpmax[maxn][maxn][8[8];Here n is the square of the length of the square, here is the topic, and then mm is preprocessed, convenient to calculate the indexDpmin and Dpmax are preprocessing arrays.Then take a look at the start pretreatment:voidINITRMQ (intNintm

One: STL/RET/CMP/ZCPDescription: Simple Shun control instructions do not do other instructions.Control requirements : NoneProgramming Ladder diagram:Structured Programming ST Language:(* Step instruction STL (EN,S); *) SET (M8002,S3); STL (TRUE,S3) m419:=true;out_t (TRUE,TC0,K10); SET (TS0,S20); STL (TRUE,S20); m420:=true;out_t (TRUE,TC1,K15); s3:=ts1; (* Step instruction ret (EN); *) ret (TRUE);(* Compare instruction CMP (EN,S1,S2,D); *) CMP (M37,K10

RMQ problem (range max problem range minimum/maximum Query)　　　　St algorithmRMQ (range minimum/maximum query), or interval-most-valued queries, refers to the question of answering a number of queries RMQ (A,I,J) (I, jSuppose that the A array is:1, 3, 6, 7, 4, 2, 5　　　　1. Preprocessing　　　　Set DP[I][J] Indicates the maximum number of consecutive 2^j from the first bit. For example, Dp[2][1] is the maximum of 2 consecutive numbers for the 2nd digit, which