HDU digital currency
Publish: 2021-04-30 11:13:00
1. It depends on what they are engaged in. If it's the kind of touting and then having to pay, it may be pyramid selling
to see if they have a proct is a real proct
1
2. Go your own way and be the best of yourself
3. Wait for a person or a story
4. All the past will become cordial memories
5. Time is still here, we are flying
6. I enjoy the warmth in time, and I forget the flowers in fleeting time
7; Without frustration, I don't understand life
8. When you feel that you are too late, it is the earliest time< No matter how strong a person is, there is always a soft place in his heart that he can't touch
10. The color is light and will fade when it is deep; Life, simple is good, complex will deteriorate
11. It's the greatest sorrow of human beings to ask but not to, to give up but not to, to get but not to hesitate
12. I hope someone will accompany me from friendship to love, and then from love to family
13. Those who are not good or bad are in the middle, those who are envious are swaying around, and those who are envious are always unhappy
14. Don't always evaluate your position in other people's hearts. To live in other people's eyes is to lose yourself
15. It's good to be half drunk when drinking wine. If you drink too much, you will be drunk. Love, or half really good, love too deep heartbreak
16. Life is too short, there is no time for regret, if not the end, please smile forward
17. Never mention it is not because of forgetting, but because of remembering
18. Do you really want to get to know someone again
19. Don't overestimate yourself in two years or underestimate yourself in ten years
20. Where it exists, it blooms. Don't forget to send out fragrance just because you are sad
21. Time is changing, so are people. Some things, no matter how hard we try, can't go back
22. You have to live in a framework to make the incomparable gift of love mature
23. When you can't hold on, you can say "I'm tired" to yourself, but never admit "I can't do it" in your heart
24. No matter how confused I am at this time, I will eventually live the life I want!
to see if they have a proct is a real proct
1
2. Go your own way and be the best of yourself
3. Wait for a person or a story
4. All the past will become cordial memories
5. Time is still here, we are flying
6. I enjoy the warmth in time, and I forget the flowers in fleeting time
7; Without frustration, I don't understand life
8. When you feel that you are too late, it is the earliest time< No matter how strong a person is, there is always a soft place in his heart that he can't touch
10. The color is light and will fade when it is deep; Life, simple is good, complex will deteriorate
11. It's the greatest sorrow of human beings to ask but not to, to give up but not to, to get but not to hesitate
12. I hope someone will accompany me from friendship to love, and then from love to family
13. Those who are not good or bad are in the middle, those who are envious are swaying around, and those who are envious are always unhappy
14. Don't always evaluate your position in other people's hearts. To live in other people's eyes is to lose yourself
15. It's good to be half drunk when drinking wine. If you drink too much, you will be drunk. Love, or half really good, love too deep heartbreak
16. Life is too short, there is no time for regret, if not the end, please smile forward
17. Never mention it is not because of forgetting, but because of remembering
18. Do you really want to get to know someone again
19. Don't overestimate yourself in two years or underestimate yourself in ten years
20. Where it exists, it blooms. Don't forget to send out fragrance just because you are sad
21. Time is changing, so are people. Some things, no matter how hard we try, can't go back
22. You have to live in a framework to make the incomparable gift of love mature
23. When you can't hold on, you can say "I'm tired" to yourself, but never admit "I can't do it" in your heart
24. No matter how confused I am at this time, I will eventually live the life I want!
2. British ecation, you need to find my assets, find the currency you need to buy, fix the price, then you can buy.
3. 对于这种使用整数就可以做的题，避免用浮点数可能存在不同的F和J，使得计算出来的T是一样的，这样的情况下你没有区分开来比如说下面这个输入1000 33 34 45 5-1 -1#include #include #include #include using namespace std;typedef struct {int f, j;}room;room r[20000];bool cmp(const room& a, const room& b){return a.f * b.j > b.f * a.j;}int main(){int n;double m;while (cin >> m >> n&&m != -1 && n != -1){for (int i = 0; i > r[i].f >> r[i].j;}sort(r, r + n, cmp);double sum = 0;int flag = 0;for (int k = 0; k = r[k].j){sum += r[k].f;m -= r[k].j;}else{sum += 1.0 * m / r[k].j * r[k].f;break;}}printf("%.3lf\n", sum);}return 0;}
4. Well, I haven't learned to go back to action for a long time, and I'm also at a loss. It's estimated that I just got started two months ago...
you can see what he wrote about the best substructure with no aftereffect, and I'm also the biggest%...
dynamic programming generally solves two kinds of problems, one is the optimization problem, which is to ask you what the maximum value is, and the other is the total number of solutions<
there are many types of subdivided words,
I've seen a lot (I'm a sophomore in senior high school, and I'm currently preparing for noip)
(if you have more questions, I'll just say your name)
backpack, I won't say more when even nine lectures are put up upstairs...
the longest no rise no fall subsequence problem (for example, the flying of pampas eagle's birthday simulation contest, It is a classic non descending deformation)
resource allocation problem (such as window display, stable problem, machine allocation problem)
interval dynamic return (maximum proct, energy necklace, etc.)
longest common subsequence problem (with a genetic code)
for example, the problem of climbing stairs in the solution tree, there are many types of dynamic programming, because it is very flexible. Our teacher once found 100 DP equations for us, but they are useless. We can't remember them by heart. The key is to solve them
in depth, there are DP optimization, dimension rection of time and space (that is, using other methods to do it, or for example, the knapsack is originally two-dimensional, space optimization should be one-dimensional), and tree DP (I don't know this)
(there is a classic question "crossing the river" in optimization)
I have a sudden insight into DP... Don't mention the bluff of "dynamic programming". In fact, it is a comparison and calculation. When I know what he is doing, I will have a clue about the problem, equations and ideas...
I mainly want to see more questions, starting with simple ones, Understand his thoughts... Pay attention to the following questions when you write the questions:
1. The main premise is to make sure that you are doing the questions of action and return... If you see more, you will know what kind of questions you are facing
2. The second premise is to have the right idea (when I do the questions, I first think about the dimension of time and space, and then think about the equation according to this), and the equation is correct,
if you really can't think of it, you can read the solution first, understand other people's ideas, and then don't look at the standard program to make the program out...
3. Pay attention not to open the array too small, but generally open the left and right a little larger, for example, if the data range is 1 ~ 100, the array will open 0 ~ 101 The initial value should be correct, because many other parts of DP are correct, because it is very common that the initial value is assigned wrongly and all of them can't pass... (for example, the currency system in USACO)
5. The range of DP cycle should be correct. Generally, the range should be determined according to the questions (for example, the window problem, There are many DP questions in USACO that can be done...
I hope it can help you
I'm also learning. Not all of the above things are correct, but it's very useful for me. It's also my experience. I hope we can learn, communicate and make progress together in the future
QQ: 340131980
1. Resource problem 1
machine assignment problem
F [I, J]: = max (f [I-1, k] + w [I, J-K])
2. Resource problem 2
- - 01 knapsack problem
F [I, J]: = max (f [I-1, J-V] + W, f [I-1, J])
3. Linear dynamic programming 1
--- naive longest non descending subsequence
F: = max {f [J] + 1}
4. Partition problem 1
--- stone merging
F [I, J]: = min (f [I, k] + F [K + 1, J] + sum [I, J])
5. Subdivision problem 2
--- polygon subdivision
F [I, J]: = min (f [I, k] + F [K, J] + a [k] * a [J] * a)< The partition problem 3
- - maximum proct
F [I, J]: = max (f [K, J-1] * mult [K, I])
7. Resource problem 3
--- system reliability (complete knapsack)
F [I, J]: = max {f [I-1, J-C * k] * P [I, x]}
8. Greedy dynamic programming 1
--- fast food problem
F [I, J, k]: = max {f [I-1, J & # 39;, k']+( T-(j-j')* p1-(k-k')* P2) div P3}
9. Greedy dynamic programming 2
-- crossing the river f = min {f (i-k)} (not stone)
{f (i-k)} + 1} (stone)+ Greedy compression state
10. Subdivision problem 4
--- dynamic programming of polygon discussion
F [I, J]: = max {positive f [I, k] * f [K + 1, J]
negative G [I, k] * f [K + 1, J]
positive and negative G [I, k] * f [K + 1, J]
negative positive f [I, k] * g [K + 1, J];} G is min
11. Tree type dynamic programming 1
--- additional binary tree (from both sides to root node model)
F [I, J]: = max {f [I, k-1] * f [K + 1, J] + C [k]}
12. Tree type dynamic programming 2
--- course selection (multi fork tree to binary tree, top-down model)
F [I, k-1] * f [K + 1, J] + C [k]}
12, j] It means the maximum credit obtained by selecting J courses with I as the root node
F [I, J]: = max {f [T.L, k] + F [T.R, j-k-1] + C}
13. Counting problem 1
--- weight weighing
F [f [0] + 1] = f [J] + k * w [J]< br />(1<= i<= n; 1<= j<= f[0]; 1<= k<= a;)
14. Recursive Tiandi 1
--- nuclear power plant problem
F [- 1]: = 1; f[0]:=1;
F: = 2 * f [I-1] - f [i-1-m]
15. The division of recursive heaven and earth 2
--- numbers
F [I, J]: = f [I-J, J] + F [I-1, J-1]
16. Maximal submatrix 1
--- a maximal 01 submatrix
F [I, J]: = min (f [I-1, J], v [I, J-1], v [I-1, J-1]) + 1< br />ans:=maxvalue(f);
17. Determinant question 1
--- whether it can be divisible by 4
G [1,0]: = true; g[1,1]:=false; g[1,2]:=false; g[1,3]:=false;
G [I, J]: = g [I-1, k] and ((K + a [I, P]) mod 4 = J)
18 ± n mod k]:=f[i-1,j]; - k<= j<= k; 1<= i<= N
20. Linear dynamic programming 2
-- block elimination game
F [I, i-1,0]: = 0
F [I, J, k] = max {f [I, j-1,0] + SQR (len (J) + k),
F [I, P, K + len [J]] + F [P + 1, j-1,0]}
ans: = f [1, m, 0]
21. Linear dynamic programming 3
-- longest common substring, LCS problem
F [I, J] = {0 (I = 0) & (J = 0)< br /> f[i-1,j-1]+1 (i> 0,j> 0,x=y[j]);< br /> max{f[i,j-1]+f[i-1,j]}} (i> 0,j> 0,x<& gt; y[j]);
22. Maximal submatrix 2
--- the beginning of the maximal weighted 01 submatrix o (n ^ 2 * m)
is compressed into a sequence to find the maximal field sum, and then cleared when 0
23. Resource problem 4
--- packing problem (deterministic 01 knapsack)
F [J]: = (f [J] or f [J-V])
24. Number triangle 1
--- simple number triangle
F [I, J]: = max (f [i + 1, J] + a [I, J], f [i + 1, j + 1] + a [I, J])<
25. Digital triangle 2
--- hill in a sunny day
dynamic planning of violence at the same stage
if [I, J]: = min (f [I, J-1], f [I, j + 1], f [I-1, J], f [I-1, J-1]) + a [I, J]
26. Bidirectional dynamic planning 1
Digital triangle 3
--- xiaopang certificate
F [I, J] = max (f [I-1, J] + a [I, J], f [I, J-1] + a [I, J], f [I, j + 1] + a [I, J], f [I, j + 1] + a [I, j] )
27. Digital triangle 4
--- river crossing pawn
/ / boundary initialization
F [I, J]: = f [I-1, J] + F [I, J-1]
28. Digital triangle 5
--- simple brick making
F [I, J, k]: = max (f [I-1, J-K, P] + sum [I, k], f [I, J, k])
29. Digital triangle 6
--- optimized brick beating
F [I, J, k]: = max {G [I-1, J-K, k-1] + sum [I, k]}
30. Linear dynamic Programming 3
--- mole beating '
F: = f [J] + 1 abs(x-x[j])+abs(y-y[j])<= T-T [J])
31. Tree dynamic programming 3
--- greedy nine headed dragon
32. State compression dynamic programming 1
--- artillery position
max (f [Q * (R + 1) + k], G [J] + num [k])
if (map and plan [k] = 0) and
((plan [P] or plan [q]) and plan [k] = 0)
33. Recursive world 3
--- love letter scribe
F: = f [I-1] + k * f [I-2]
34. Recursive world 4
--- staggered arrangement
F: = (i-1) (f [I-2] + F [I-1])< br />f[n]:=n*f[n-1]+(-1)^(n-2);
35. Recursive heaven and earth 5
--- the maximum number of regions of the linear plane
F [n]: = f [n-1] + n
: = n * (n + 1) div 2 + 1
36. Recursive heaven and earth 6
--- the maximum area number of broken line sub plane
F [n]: = (n-1) (2 * n-1) + 2 * n
37. Recursive heaven and earth 7
--- the maximum number of sub plane regions of closed curve
F [n]: = f [n-1] + 2 * (n-1)
: = SQR (n) - N + 2
38 recursive universe 8
--- the number of triangulation methods for convex polygons
F [n]: = C (2 * n-2, n-1) div n
for a k-polygon,
F [k]: = C (2 * K-4, K-2) div (k-1)// k>= 3)
39 recursive heaven and earth 9
--- general form of Catalan sequence
1,1,2,5,14,42132
F [n]: = C (2k, K) div (K + 1)<
40 recursive world 10
--- circular dyeing problem in arrangement and combination of colored lights
F [n]: = f [n-1] * (m-2) + F [n-2] * (m-1) f[1]:=m; f[2]:=m(m-1);
41 linear dynamic programming 4
--- find number
linear scan
sum: = F + G [J]< br /> (if sum=Aim then getout; if sum< Aim then inc(i) else inc(j);)
42 linear dynamic programming 5
--- invisible wings
Min: = min {ABS (w / w [J] - gold)}< br /> if w/w[j]< gold then inc(i) else inc(j);
43 subdivision problem 5
--- maximum reward
F: = max (F, f [J] + (sum [J] - sum) * I-T
44 shortest path 1
--- Floyd
F [I, J]: = max (f [I, J], f [I, k] + F [K, J])< br /> ans[q[i,j,k]]:=ans[q[i,j,k]]+s[i,q[i,j,k]]*s[q[i,j,k],j]/s[i,j];
45 partition problem 6
--- small h's cabin
F [l, m, n]: = f [l-x, M-1, n-k] + s (x, K)<
46 counting problem 2
--- the secret of meteorites (counting problem in permutations)
ans [L1, L2, L3, D]: = f [L1 + 1, L2, L3, D + 1] - f [L1 + 1, L2, L3, D]< br />F[l1,l2,l3,D]:=Sigma(f[o,p,q,d-1]*f[l1-o,l2-p,l3-q,d]);<
47 linear dynamic programming
- - Chorus formation
twice F: = max {f [J] + 1} + enumerate central node
48 resource problem
- - explicit budget scheme: dynamic programming with flowers
F [I, J]: = max (f [I, J], f [l, J-V [FB] - v [FA]] + V * P + v [FB] * P [FB] + v [FA] * P [FA])<
49 resource problem
--- packer of chemical plant
50 tree dynamic programming
--- Happy Party
F [I, 2]: = max (f [I, 0], f [I, 1])< br />f[i,1]:=sigma(f[t^.son,0]);< br />f[i,0]:=sigma(f[t^.son,3]);<
51 tree dynamic programming
--- palace guard
F [I, 2]: = max (f [I, 0], f [I, 1])< br />f[i,1]:=sigma(f[t^.son,0]);< br />f[i,0]:=sigma(f[t^.son,3]);<
52 recursive world
--- box and ball
F [I, 1]: = 1< br />f[i,j]:=j*(f[i-1,j-1]+f[i-1,j]);
53 double dynamic
you can see what he wrote about the best substructure with no aftereffect, and I'm also the biggest%...
dynamic programming generally solves two kinds of problems, one is the optimization problem, which is to ask you what the maximum value is, and the other is the total number of solutions<
there are many types of subdivided words,
I've seen a lot (I'm a sophomore in senior high school, and I'm currently preparing for noip)
(if you have more questions, I'll just say your name)
backpack, I won't say more when even nine lectures are put up upstairs...
the longest no rise no fall subsequence problem (for example, the flying of pampas eagle's birthday simulation contest, It is a classic non descending deformation)
resource allocation problem (such as window display, stable problem, machine allocation problem)
interval dynamic return (maximum proct, energy necklace, etc.)
longest common subsequence problem (with a genetic code)
for example, the problem of climbing stairs in the solution tree, there are many types of dynamic programming, because it is very flexible. Our teacher once found 100 DP equations for us, but they are useless. We can't remember them by heart. The key is to solve them
in depth, there are DP optimization, dimension rection of time and space (that is, using other methods to do it, or for example, the knapsack is originally two-dimensional, space optimization should be one-dimensional), and tree DP (I don't know this)
(there is a classic question "crossing the river" in optimization)
I have a sudden insight into DP... Don't mention the bluff of "dynamic programming". In fact, it is a comparison and calculation. When I know what he is doing, I will have a clue about the problem, equations and ideas...
I mainly want to see more questions, starting with simple ones, Understand his thoughts... Pay attention to the following questions when you write the questions:
1. The main premise is to make sure that you are doing the questions of action and return... If you see more, you will know what kind of questions you are facing
2. The second premise is to have the right idea (when I do the questions, I first think about the dimension of time and space, and then think about the equation according to this), and the equation is correct,
if you really can't think of it, you can read the solution first, understand other people's ideas, and then don't look at the standard program to make the program out...
3. Pay attention not to open the array too small, but generally open the left and right a little larger, for example, if the data range is 1 ~ 100, the array will open 0 ~ 101 The initial value should be correct, because many other parts of DP are correct, because it is very common that the initial value is assigned wrongly and all of them can't pass... (for example, the currency system in USACO)
5. The range of DP cycle should be correct. Generally, the range should be determined according to the questions (for example, the window problem, There are many DP questions in USACO that can be done...
I hope it can help you
I'm also learning. Not all of the above things are correct, but it's very useful for me. It's also my experience. I hope we can learn, communicate and make progress together in the future
QQ: 340131980
1. Resource problem 1
machine assignment problem
F [I, J]: = max (f [I-1, k] + w [I, J-K])
2. Resource problem 2
- - 01 knapsack problem
F [I, J]: = max (f [I-1, J-V] + W, f [I-1, J])
3. Linear dynamic programming 1
--- naive longest non descending subsequence
F: = max {f [J] + 1}
4. Partition problem 1
--- stone merging
F [I, J]: = min (f [I, k] + F [K + 1, J] + sum [I, J])
5. Subdivision problem 2
--- polygon subdivision
F [I, J]: = min (f [I, k] + F [K, J] + a [k] * a [J] * a)< The partition problem 3
- - maximum proct
F [I, J]: = max (f [K, J-1] * mult [K, I])
7. Resource problem 3
--- system reliability (complete knapsack)
F [I, J]: = max {f [I-1, J-C * k] * P [I, x]}
8. Greedy dynamic programming 1
--- fast food problem
F [I, J, k]: = max {f [I-1, J & # 39;, k']+( T-(j-j')* p1-(k-k')* P2) div P3}
9. Greedy dynamic programming 2
-- crossing the river f = min {f (i-k)} (not stone)
{f (i-k)} + 1} (stone)+ Greedy compression state
10. Subdivision problem 4
--- dynamic programming of polygon discussion
F [I, J]: = max {positive f [I, k] * f [K + 1, J]
negative G [I, k] * f [K + 1, J]
positive and negative G [I, k] * f [K + 1, J]
negative positive f [I, k] * g [K + 1, J];} G is min
11. Tree type dynamic programming 1
--- additional binary tree (from both sides to root node model)
F [I, J]: = max {f [I, k-1] * f [K + 1, J] + C [k]}
12. Tree type dynamic programming 2
--- course selection (multi fork tree to binary tree, top-down model)
F [I, k-1] * f [K + 1, J] + C [k]}
12, j] It means the maximum credit obtained by selecting J courses with I as the root node
F [I, J]: = max {f [T.L, k] + F [T.R, j-k-1] + C}
13. Counting problem 1
--- weight weighing
F [f [0] + 1] = f [J] + k * w [J]< br />(1<= i<= n; 1<= j<= f[0]; 1<= k<= a;)
14. Recursive Tiandi 1
--- nuclear power plant problem
F [- 1]: = 1; f[0]:=1;
F: = 2 * f [I-1] - f [i-1-m]
15. The division of recursive heaven and earth 2
--- numbers
F [I, J]: = f [I-J, J] + F [I-1, J-1]
16. Maximal submatrix 1
--- a maximal 01 submatrix
F [I, J]: = min (f [I-1, J], v [I, J-1], v [I-1, J-1]) + 1< br />ans:=maxvalue(f);
17. Determinant question 1
--- whether it can be divisible by 4
G [1,0]: = true; g[1,1]:=false; g[1,2]:=false; g[1,3]:=false;
G [I, J]: = g [I-1, k] and ((K + a [I, P]) mod 4 = J)
18 ± n mod k]:=f[i-1,j]; - k<= j<= k; 1<= i<= N
20. Linear dynamic programming 2
-- block elimination game
F [I, i-1,0]: = 0
F [I, J, k] = max {f [I, j-1,0] + SQR (len (J) + k),
F [I, P, K + len [J]] + F [P + 1, j-1,0]}
ans: = f [1, m, 0]
21. Linear dynamic programming 3
-- longest common substring, LCS problem
F [I, J] = {0 (I = 0) & (J = 0)< br /> f[i-1,j-1]+1 (i> 0,j> 0,x=y[j]);< br /> max{f[i,j-1]+f[i-1,j]}} (i> 0,j> 0,x<& gt; y[j]);
22. Maximal submatrix 2
--- the beginning of the maximal weighted 01 submatrix o (n ^ 2 * m)
is compressed into a sequence to find the maximal field sum, and then cleared when 0
23. Resource problem 4
--- packing problem (deterministic 01 knapsack)
F [J]: = (f [J] or f [J-V])
24. Number triangle 1
--- simple number triangle
F [I, J]: = max (f [i + 1, J] + a [I, J], f [i + 1, j + 1] + a [I, J])<
25. Digital triangle 2
--- hill in a sunny day
dynamic planning of violence at the same stage
if [I, J]: = min (f [I, J-1], f [I, j + 1], f [I-1, J], f [I-1, J-1]) + a [I, J]
26. Bidirectional dynamic planning 1
Digital triangle 3
--- xiaopang certificate
F [I, J] = max (f [I-1, J] + a [I, J], f [I, J-1] + a [I, J], f [I, j + 1] + a [I, J], f [I, j + 1] + a [I, j] )
27. Digital triangle 4
--- river crossing pawn
/ / boundary initialization
F [I, J]: = f [I-1, J] + F [I, J-1]
28. Digital triangle 5
--- simple brick making
F [I, J, k]: = max (f [I-1, J-K, P] + sum [I, k], f [I, J, k])
29. Digital triangle 6
--- optimized brick beating
F [I, J, k]: = max {G [I-1, J-K, k-1] + sum [I, k]}
30. Linear dynamic Programming 3
--- mole beating '
F: = f [J] + 1 abs(x-x[j])+abs(y-y[j])<= T-T [J])
31. Tree dynamic programming 3
--- greedy nine headed dragon
32. State compression dynamic programming 1
--- artillery position
max (f [Q * (R + 1) + k], G [J] + num [k])
if (map and plan [k] = 0) and
((plan [P] or plan [q]) and plan [k] = 0)
33. Recursive world 3
--- love letter scribe
F: = f [I-1] + k * f [I-2]
34. Recursive world 4
--- staggered arrangement
F: = (i-1) (f [I-2] + F [I-1])< br />f[n]:=n*f[n-1]+(-1)^(n-2);
35. Recursive heaven and earth 5
--- the maximum number of regions of the linear plane
F [n]: = f [n-1] + n
: = n * (n + 1) div 2 + 1
36. Recursive heaven and earth 6
--- the maximum area number of broken line sub plane
F [n]: = (n-1) (2 * n-1) + 2 * n
37. Recursive heaven and earth 7
--- the maximum number of sub plane regions of closed curve
F [n]: = f [n-1] + 2 * (n-1)
: = SQR (n) - N + 2
38 recursive universe 8
--- the number of triangulation methods for convex polygons
F [n]: = C (2 * n-2, n-1) div n
for a k-polygon,
F [k]: = C (2 * K-4, K-2) div (k-1)// k>= 3)
39 recursive heaven and earth 9
--- general form of Catalan sequence
1,1,2,5,14,42132
F [n]: = C (2k, K) div (K + 1)<
40 recursive world 10
--- circular dyeing problem in arrangement and combination of colored lights
F [n]: = f [n-1] * (m-2) + F [n-2] * (m-1) f[1]:=m; f[2]:=m(m-1);
41 linear dynamic programming 4
--- find number
linear scan
sum: = F + G [J]< br /> (if sum=Aim then getout; if sum< Aim then inc(i) else inc(j);)
42 linear dynamic programming 5
--- invisible wings
Min: = min {ABS (w / w [J] - gold)}< br /> if w/w[j]< gold then inc(i) else inc(j);
43 subdivision problem 5
--- maximum reward
F: = max (F, f [J] + (sum [J] - sum) * I-T
44 shortest path 1
--- Floyd
F [I, J]: = max (f [I, J], f [I, k] + F [K, J])< br /> ans[q[i,j,k]]:=ans[q[i,j,k]]+s[i,q[i,j,k]]*s[q[i,j,k],j]/s[i,j];
45 partition problem 6
--- small h's cabin
F [l, m, n]: = f [l-x, M-1, n-k] + s (x, K)<
46 counting problem 2
--- the secret of meteorites (counting problem in permutations)
ans [L1, L2, L3, D]: = f [L1 + 1, L2, L3, D + 1] - f [L1 + 1, L2, L3, D]< br />F[l1,l2,l3,D]:=Sigma(f[o,p,q,d-1]*f[l1-o,l2-p,l3-q,d]);<
47 linear dynamic programming
- - Chorus formation
twice F: = max {f [J] + 1} + enumerate central node
48 resource problem
- - explicit budget scheme: dynamic programming with flowers
F [I, J]: = max (f [I, J], f [l, J-V [FB] - v [FA]] + V * P + v [FB] * P [FB] + v [FA] * P [FA])<
49 resource problem
--- packer of chemical plant
50 tree dynamic programming
--- Happy Party
F [I, 2]: = max (f [I, 0], f [I, 1])< br />f[i,1]:=sigma(f[t^.son,0]);< br />f[i,0]:=sigma(f[t^.son,3]);<
51 tree dynamic programming
--- palace guard
F [I, 2]: = max (f [I, 0], f [I, 1])< br />f[i,1]:=sigma(f[t^.son,0]);< br />f[i,0]:=sigma(f[t^.son,3]);<
52 recursive world
--- box and ball
F [I, 1]: = 1< br />f[i,j]:=j*(f[i-1,j-1]+f[i-1,j]);
53 double dynamic
5. Van Ka, written in 1886, reflects the fact that many bankrupt peasants were forced to make a living in the city ring the reign of Czar Nicholas III. they suffered from exploitation, even children. In Chekhov's small grocery store, there are two elementary school students who are often abused by his father. He understood the life of his apprentice and sympathized with the unfortunate fate of his apprentice. Therefore, the novel "Vanka" is truly moving and makes us see the miserable life of the poor working people in old Russia
this text reflects the tragic fate of the poor children in Russian society under the rule of the Czar and reveals the darkness of the social system at that time through the fact that Fanka wrote to his grandfather. The article describes the process of writing a letter. It begins to narrate that on Christmas Eve, Vanka secretly wrote a letter to his grandfather while the boss, the landlady and the guys went to church; Then, he wrote to his grandfather and told him about his miserable life as an apprentice in the shoe shop. He repeatedly begged his grandfather to take him away from here and go back to the countryside, and recalled his life with him; Finally, Fanka didn't write the address and name of the recipient clearly, so he put the letter into the mailbox. In his sweet dream, he saw his grandfather reading his letter. There are two main features in this paper. The first is about the tragic experience of Vanka, which consists of three parts: the author's narration, Vanka's letter and his recollection in the process of writing the letter...
Vanka was written by the famous Russian writer Chekov in 1886, when it was the darkest period of the Russian Tsar's rule, people lived a miserable life, and countless bankrupt farmers were forced to make a living in the city, They are deeply exploited, even children. In his father's grocery store, Chekov witnessed his father's maltreatment of the young apprentice and sympathized with the fate of the young apprentice
Vanka is selected from a short story by Chekhov, a famous Russian writer. Chekhov is a Russian critical realism writer. He lived in the darkest and most brutal era of Russian czar rule. The novel, written in 1886, reflects the darkest era under the Tsar. At that time, countless bankrupt farmers were forced to make a living in cities. They were deeply exploited, even children. Chekhov wrote the tragic experience of his apprentice through the letter to his grandfather, accused the dark rule of tsarist Russia, and revealed the darkness of tsarist system and the evils of the society at that time“ Vanka is the epitome of thousands of Russian children
Chekhov is a great Russian critical realist writer in the late 19th century, a humorous satirist with profound taste and sharp writing style, a master of short stories and a famous playwright. With his excellent satire and humor, he added two immortal artistic images to the gallery of world literary figures. His famous saying "simplicity is the sister of genius" has become the motto pursued by later writers
his novels are short, concise, simple, compact in structure, vivid in plot, humorous in style, lively in language, rich in musical rhythm and profound in implication. He is good at discovering typical people and things from his daily life, making artistic generalization through humorous plots, and shaping a complete typical image to reflect the Russian society at that time. His representative works chameleon and man in the middle can be regarded as exquisite and perfect art treasures in the history of Russian literature; The latter has become a symbol of those who are conservative, timid and afraid of change< br />\ <
Chekhov, (1860-1904)
at the end of the 19th century, he was a great Russian critical realist writer, a humorous satirist with profound taste and sharp writing style, a great master of short stories and a famous playwright< After his father's grocery store went bankrupt, he went through middle school as a tutor. In 1879, he entered Moscow University to study medicine. After graation in 1884, he became a doctor and began to write literature
most of his early works are short stories, such as "fat and thin" (1883), "the death of a little civil servant" (1883), "distress" (1886), "Vanka" (1886), which reproce the misfortune and weakness of "little people", the miserable life of the working people and the vulgarity of the ordinary people. In the chameleon and sergeant prishbev (1885), the author castigates the slaves who are loyal to the tyranny and their despotic and tyrannical faces, revealing the reactionary spirit of the dark age. In 1890, he went to the exile of political prisoners on the island of Sakhalin for investigation, and created works showing major social issues, such as the sixth ward (1892), which was a fierce attack on the autocratic tyranny of the czar. Lenin was greatly shocked after reading this novel The house with attic (1896) exposed the destruction of people's youth, talent and happiness in tsarist Russian society, and satirized the futility of reformist activities of the liberal local autonomy The farmer (1897) describes the extreme poverty of the peasants in the 1980s and 1990s, and shows his concern and sympathy for the miserable fate of the peasants. In the canyon, the author reveals the ferocious exploitation of the rich peasants, which reflects the infiltration of capitalism into the countryside, and points out that the author puts the expression of Russian social class struggle as the theme of his creation, He believed that the old system would die out and that the new "life would come sooner or later."< In his later works, Chekhov turned to drama creation, including Ivanov (1887), seagull (1896), uncle Vanya (1896), three sisters (1901) and cherry orchard (1903), all of which reflected the depression and pursuit of some petty bourgeois intellectuals on the eve of the great revolution in 1905. His plays are full of lyric flavor and rich subtext, which makes people have endless aftertaste. Although the story is based on daily life, the plot is simple, and the progress is smooth, it is full of profound symbolic significance
his novels are short, concise and simple, compact in structure, vivid in plot, humorous in style, lively in language, rich in musical rhythm and profound in implication. He is good at discovering typical people and things from his daily life, making artistic generalization through humorous plots, and shaping a complete typical image to reflect the Russian society at that time. His representative works chameleon and man in the middle can be regarded as exquisite and perfect art treasures in the history of Russian literature; The latter has become a symbol of those who are conservative, timid and afraid of change
Chekhov added two immortal artistic images to the gallery of world literary figures with his excellent satire and humor. His famous saying "simplicity is the sister of genius" has become the motto pursued by later writers
Chekov cherishes good feelings for the Chinese people. He once asked Gorky to visit China together, but he failed because of his long illness. On July 15, 1904, he died of worsening lung disease<
the first class hour
teaching objectives:
1. Learn 10 new words and understand the four words of "dip, stamp, skim and drunk". Can read and write the following words correctly: cabinet, rust, moping, fur coat, grab, congee, catch, address, mailbox, warm Kang, Christmas
teaching process:
I. writing on the blackboard and solving problems
1
"Fanka" is the character in the story. This paper is based on the names of the characters in the story
2. Introce the writer of this article
the author of this paper is Chekhov. He is a famous Russian writer. Born in 1860, died in 1904. Born in a small business family, he went to Moscow University to study medicine in 1879. I worked as a shop assistant and a doctor. He lived at the end of the 19th century, the darkest time for the czar to rule Russia. Social unrest. His works mercilessly exposed the unreasonable social system and the evils of capitalist society under the rule of czar
3. Introce the writing background of Fanka< In 1886, Vanka reflects the fact that many bankrupt peasants were forced to make a living in the city ring the reign of Czar Nicholas III. they were deeply exploited and even children were not spared. In Chekhov's small grocery store, there are two elementary school students who are often abused by his father. He understood the life of his apprentice and sympathized with the unfortunate fate of his apprentice. Therefore, the novel "Vanka" is truly moving and makes us see the miserable life of the poor working people in old Russia
2. Show the requirements and teach yourself in class
1
2; On the basis of finding out the paragraph in the letter, segment the text
3. With the help of thinking questions after class, read the text paragraph by paragraph and try to understand the text
4< Third, check the preview of students
1. Write words in pinyin
2. Mark "√" after the correct pronunciation
3. Understanding words:
moping: gently press it with your hand and move it one by one
last: the model used in shoe and hat making, which is mostly made of wood
blessing: superstitious people call it the protection and support of divine power
compassion: charity and compassion
send: send (out)
villa: a garden house built in the suburb or scenic area for recuperation
tease: make fun of or embarrass others
prayer: believers or superstitious people turn to heaven or God for help
sniff: sniff and cry in a low voice
ruble: the name of the Russian monetary unit
drunk: it describes the appearance of being drunk< 4. Listen to the teacher read the text and clear up the content of the text
1. Listen and think: what does the text say about Vanka
(the text mainly writes about van Ka's letter to his grandfather.)
2. Clarify the context of the article
what parts of the text are covered by the letter? Can you try to segment the text
3
(it is divided into three parts: before writing a letter (1-2 natural paragraphs); In writing a letter (3-15 natural paragraphs); After writing a letter (6-21 natural paragraphs)
first paragraph: on Christmas Eve, Vanka secretly prepared to write a letter while the boss was at church
the second paragraph: the content and association of Fanka's letter
the third paragraph: every card writes the envelope, sends the letter and the dream after sending the letter
follow up: can you talk about the basis of segmentation
(in the order of events.)
fifth, assign homework
read the text with emotion, and read the most moving place several times<
the second class hour
teaching purpose:
1. Understand the content of the text, understand the tragic life experience of Vanka, and experience the thoughts and feelings expressed in the text
2
this text reflects the tragic fate of the poor children in Russian society under the rule of the Czar and reveals the darkness of the social system at that time through the fact that Fanka wrote to his grandfather. The article describes the process of writing a letter. It begins to narrate that on Christmas Eve, Vanka secretly wrote a letter to his grandfather while the boss, the landlady and the guys went to church; Then, he wrote to his grandfather and told him about his miserable life as an apprentice in the shoe shop. He repeatedly begged his grandfather to take him away from here and go back to the countryside, and recalled his life with him; Finally, Fanka didn't write the address and name of the recipient clearly, so he put the letter into the mailbox. In his sweet dream, he saw his grandfather reading his letter. There are two main features in this paper. The first is about the tragic experience of Vanka, which consists of three parts: the author's narration, Vanka's letter and his recollection in the process of writing the letter...
Vanka was written by the famous Russian writer Chekov in 1886, when it was the darkest period of the Russian Tsar's rule, people lived a miserable life, and countless bankrupt farmers were forced to make a living in the city, They are deeply exploited, even children. In his father's grocery store, Chekov witnessed his father's maltreatment of the young apprentice and sympathized with the fate of the young apprentice
Vanka is selected from a short story by Chekhov, a famous Russian writer. Chekhov is a Russian critical realism writer. He lived in the darkest and most brutal era of Russian czar rule. The novel, written in 1886, reflects the darkest era under the Tsar. At that time, countless bankrupt farmers were forced to make a living in cities. They were deeply exploited, even children. Chekhov wrote the tragic experience of his apprentice through the letter to his grandfather, accused the dark rule of tsarist Russia, and revealed the darkness of tsarist system and the evils of the society at that time“ Vanka is the epitome of thousands of Russian children
Chekhov is a great Russian critical realist writer in the late 19th century, a humorous satirist with profound taste and sharp writing style, a master of short stories and a famous playwright. With his excellent satire and humor, he added two immortal artistic images to the gallery of world literary figures. His famous saying "simplicity is the sister of genius" has become the motto pursued by later writers
his novels are short, concise, simple, compact in structure, vivid in plot, humorous in style, lively in language, rich in musical rhythm and profound in implication. He is good at discovering typical people and things from his daily life, making artistic generalization through humorous plots, and shaping a complete typical image to reflect the Russian society at that time. His representative works chameleon and man in the middle can be regarded as exquisite and perfect art treasures in the history of Russian literature; The latter has become a symbol of those who are conservative, timid and afraid of change< br />\ <
Chekhov, (1860-1904)
at the end of the 19th century, he was a great Russian critical realist writer, a humorous satirist with profound taste and sharp writing style, a great master of short stories and a famous playwright< After his father's grocery store went bankrupt, he went through middle school as a tutor. In 1879, he entered Moscow University to study medicine. After graation in 1884, he became a doctor and began to write literature
most of his early works are short stories, such as "fat and thin" (1883), "the death of a little civil servant" (1883), "distress" (1886), "Vanka" (1886), which reproce the misfortune and weakness of "little people", the miserable life of the working people and the vulgarity of the ordinary people. In the chameleon and sergeant prishbev (1885), the author castigates the slaves who are loyal to the tyranny and their despotic and tyrannical faces, revealing the reactionary spirit of the dark age. In 1890, he went to the exile of political prisoners on the island of Sakhalin for investigation, and created works showing major social issues, such as the sixth ward (1892), which was a fierce attack on the autocratic tyranny of the czar. Lenin was greatly shocked after reading this novel The house with attic (1896) exposed the destruction of people's youth, talent and happiness in tsarist Russian society, and satirized the futility of reformist activities of the liberal local autonomy The farmer (1897) describes the extreme poverty of the peasants in the 1980s and 1990s, and shows his concern and sympathy for the miserable fate of the peasants. In the canyon, the author reveals the ferocious exploitation of the rich peasants, which reflects the infiltration of capitalism into the countryside, and points out that the author puts the expression of Russian social class struggle as the theme of his creation, He believed that the old system would die out and that the new "life would come sooner or later."< In his later works, Chekhov turned to drama creation, including Ivanov (1887), seagull (1896), uncle Vanya (1896), three sisters (1901) and cherry orchard (1903), all of which reflected the depression and pursuit of some petty bourgeois intellectuals on the eve of the great revolution in 1905. His plays are full of lyric flavor and rich subtext, which makes people have endless aftertaste. Although the story is based on daily life, the plot is simple, and the progress is smooth, it is full of profound symbolic significance
his novels are short, concise and simple, compact in structure, vivid in plot, humorous in style, lively in language, rich in musical rhythm and profound in implication. He is good at discovering typical people and things from his daily life, making artistic generalization through humorous plots, and shaping a complete typical image to reflect the Russian society at that time. His representative works chameleon and man in the middle can be regarded as exquisite and perfect art treasures in the history of Russian literature; The latter has become a symbol of those who are conservative, timid and afraid of change
Chekhov added two immortal artistic images to the gallery of world literary figures with his excellent satire and humor. His famous saying "simplicity is the sister of genius" has become the motto pursued by later writers
Chekov cherishes good feelings for the Chinese people. He once asked Gorky to visit China together, but he failed because of his long illness. On July 15, 1904, he died of worsening lung disease<
the first class hour
teaching objectives:
1. Learn 10 new words and understand the four words of "dip, stamp, skim and drunk". Can read and write the following words correctly: cabinet, rust, moping, fur coat, grab, congee, catch, address, mailbox, warm Kang, Christmas
teaching process:
I. writing on the blackboard and solving problems
1
"Fanka" is the character in the story. This paper is based on the names of the characters in the story
2. Introce the writer of this article
the author of this paper is Chekhov. He is a famous Russian writer. Born in 1860, died in 1904. Born in a small business family, he went to Moscow University to study medicine in 1879. I worked as a shop assistant and a doctor. He lived at the end of the 19th century, the darkest time for the czar to rule Russia. Social unrest. His works mercilessly exposed the unreasonable social system and the evils of capitalist society under the rule of czar
3. Introce the writing background of Fanka< In 1886, Vanka reflects the fact that many bankrupt peasants were forced to make a living in the city ring the reign of Czar Nicholas III. they were deeply exploited and even children were not spared. In Chekhov's small grocery store, there are two elementary school students who are often abused by his father. He understood the life of his apprentice and sympathized with the unfortunate fate of his apprentice. Therefore, the novel "Vanka" is truly moving and makes us see the miserable life of the poor working people in old Russia
2. Show the requirements and teach yourself in class
1
2; On the basis of finding out the paragraph in the letter, segment the text
3. With the help of thinking questions after class, read the text paragraph by paragraph and try to understand the text
4< Third, check the preview of students
1. Write words in pinyin
2. Mark "√" after the correct pronunciation
3. Understanding words:
moping: gently press it with your hand and move it one by one
last: the model used in shoe and hat making, which is mostly made of wood
blessing: superstitious people call it the protection and support of divine power
compassion: charity and compassion
send: send (out)
villa: a garden house built in the suburb or scenic area for recuperation
tease: make fun of or embarrass others
prayer: believers or superstitious people turn to heaven or God for help
sniff: sniff and cry in a low voice
ruble: the name of the Russian monetary unit
drunk: it describes the appearance of being drunk< 4. Listen to the teacher read the text and clear up the content of the text
1. Listen and think: what does the text say about Vanka
(the text mainly writes about van Ka's letter to his grandfather.)
2. Clarify the context of the article
what parts of the text are covered by the letter? Can you try to segment the text
3
(it is divided into three parts: before writing a letter (1-2 natural paragraphs); In writing a letter (3-15 natural paragraphs); After writing a letter (6-21 natural paragraphs)
first paragraph: on Christmas Eve, Vanka secretly prepared to write a letter while the boss was at church
the second paragraph: the content and association of Fanka's letter
the third paragraph: every card writes the envelope, sends the letter and the dream after sending the letter
follow up: can you talk about the basis of segmentation
(in the order of events.)
fifth, assign homework
read the text with emotion, and read the most moving place several times<
the second class hour
teaching purpose:
1. Understand the content of the text, understand the tragic life experience of Vanka, and experience the thoughts and feelings expressed in the text
2
6. The Three Kingdoms heroes pass on the business of the overlord. The skills of killing monsters in the field 1. The yellow scarf army needs a crusade order to kill the yellow scarf. Each Crusade order will be refreshed once every half an hour, and the indivial will kill it. The higher the level, the more resources you can proce, and the more advanced the acceleration props are. Relatively, the more difficult it is. Generally, it takes more than one time of troops to kill Huangjin without damage, and the type of arms is not seriously restrained. Please choose the level according to your personal combat power. Yellow scarf activities will be open from time to time to provide more advanced angle, need to gather allies to kill, more rewards, unlimited number of times< 2. Nanman tribe
Nanman tribe can't kill by itself, it needs more than two alliance members to join in the assembly, the strength is the same as Huangjin, it needs at least more than one time of troops to win
according to the number of enemies killed, you can get the booty box. Nanman below level 5 is the top three reward, and Nanman above level 6 is the top four reward. Nanman's spoils are assembly order resource battle flag, in which assembly order is a necessity to initiate the assembly of players, and battle flag is a prop to upgrade the diplomatic office. They are all a lot of consumables, so Nanman is a must brush monster for daily development
3. Bandits
bandits can only refresh the level 2 Resource Zone, kill indivials, provide art of war props, and use them to improve the attributes of generals. The promotion of the general's attributes needs a lot of military props, which belongs to the long-term development of the game. Every day, you should remember to brush up the bandits
the intensity of bandits is not high, but the restraint of arms is obvious, so try to choose the opposite arms to kill< 4. Camp activities
camp disputes start for a long time, and the special wild monsters will be refreshed on the map. Players randomly join the Shu Wei camp to kill the hostile wild monsters and get points. If the points meet certain requirements, they can get rewards. Finally, the camp with higher settlement scores will get all rewards.
Nanman tribe can't kill by itself, it needs more than two alliance members to join in the assembly, the strength is the same as Huangjin, it needs at least more than one time of troops to win
according to the number of enemies killed, you can get the booty box. Nanman below level 5 is the top three reward, and Nanman above level 6 is the top four reward. Nanman's spoils are assembly order resource battle flag, in which assembly order is a necessity to initiate the assembly of players, and battle flag is a prop to upgrade the diplomatic office. They are all a lot of consumables, so Nanman is a must brush monster for daily development
3. Bandits
bandits can only refresh the level 2 Resource Zone, kill indivials, provide art of war props, and use them to improve the attributes of generals. The promotion of the general's attributes needs a lot of military props, which belongs to the long-term development of the game. Every day, you should remember to brush up the bandits
the intensity of bandits is not high, but the restraint of arms is obvious, so try to choose the opposite arms to kill< 4. Camp activities
camp disputes start for a long time, and the special wild monsters will be refreshed on the map. Players randomly join the Shu Wei camp to kill the hostile wild monsters and get points. If the points meet certain requirements, they can get rewards. Finally, the camp with higher settlement scores will get all rewards.
Hot content