Arrange the 100 numbers of 1, 2, 3, 4, 5, 6, 100 randomly as A1, A2, A3, A4, A5, if the adjacent two Put 1,2,3,4,5 The 100 numbers of 100 are arranged arbitrarily as A1, A2, A3, A4, A5 A100. If two adjacent numbers on the left are larger than those on the right, exchanging their positions is called one exchange. Until the 100 numbers on the left are larger than those on the right, now we know that the fourth number is 40, and the 95th number is 99. How many exchanges should we arrange this group of numbers at most Yes, come and no, go away. The answer is 4800. What I want is the process

Arrange the 100 numbers of 1, 2, 3, 4, 5, 6, 100 randomly as A1, A2, A3, A4, A5, if the adjacent two Put 1,2,3,4,5 The 100 numbers of 100 are arranged arbitrarily as A1, A2, A3, A4, A5 A100. If two adjacent numbers on the left are larger than those on the right, exchanging their positions is called one exchange. Until the 100 numbers on the left are larger than those on the right, now we know that the fourth number is 40, and the 95th number is 99. How many exchanges should we arrange this group of numbers at most Yes, come and no, go away. The answer is 4800. What I want is the process

The remaining 1-1 / 3 = 2 / 3
The next day I saw 2 / 3 * 2 / 3 = 4 / 9
I watched 4 / 9 + 1 / 3 = 7 / 9 in two days
The third day should see 1-7 / 9 = 2 / 9

The seven natural numbers of 1, 2, 3, 4, 5, 6 and 7 should be arranged arbitrarily, A1, A2, A3, A4, A5, A6 and A7, so that | a1-a2 | + | A2-A3 | + +|The sum of a6-a7 | is the largest. What is the maximum {process and result}

23 is right, the teacher said
Like 4617253
4172635..

M = A2 + AB + b2-1, n = A2 + AB + B2 + Z, then the relationship between M and N is that the following number is square

M-N=a2+ab+b2-1-(a2+ab+b2+z,)=a2+ab+b2-1-a2-ab-b2-z,=-1-z
When - 1-z > 0, it means Zn
When - 1-z-1 M

Compare the size of A2 + B2 and 2a-8b-17
A2 + B2 ------ the square of a + the square of B