he helped me find the cat 为啥过去式在help上，不是found 上？
Posted
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了he helped me find the cat 为啥过去式在help上，不是found 上？相关的知识，希望对你有一定的参考价值。
他帮助我找到了猫。谓语动词是帮助主语是他宾语是我找到了猫是宾补所以过去式应该在谓语动词上也就是 help上 参考技术A help sb do sth. 固定搭配啊~ 参考技术B help sb do sth. 或help sb to do sth. 都对，题中用的是不带to的不定式作宾语补足语。Help Me Escape ZOJ - 3640
Background
If thou doest well, shalt thou not be accepted? and if thou doest not well, sin lieth at the door. And unto thee shall be his desire, and thou shalt rule over him.
And Cain talked with Abel his brother: and it came to pass, when they were in the field, that Cain rose up against Abel his brother, and slew him.
And the LORD said unto Cain, Where is Abel thy brother? And he said, I know not: Am I my brother‘s keeper?
And he said, What hast thou done? the voice of thy brother‘s blood crieth unto me from the ground.
And now art thou cursed from the earth, which hath opened her mouth to receive thy brother‘s blood from thy hand;
When thou tillest the ground, it shall not henceforth yield unto thee her strength; a fugitive and a vagabond shalt thou be in the earth.
—— Bible Chapter 4
Now Cain is unexpectedly trapped in a cave with N paths. Due to LORD‘s punishment, all the paths are zigzag and dangerous. The difficulty of the ith path is ci.
Then we define f as the fighting capacity of Cain. Every day, Cain will be sent to one of the N paths randomly.
Suppose Cain is in front of the ith path. He can successfully take ti days to escape from the cave as long as his fighting capacity f is larger than ci. Otherwise, he has to keep trying day after day. However, if Cain failed to escape, his fighting capacity would increase ci as the result of actual combat. (A kindly reminder: Cain will never died.)
As for ti, we can easily draw a conclusion that ti is closely related to ci. Let‘s use the following function to describe their relationship:
After D days, Cain finally escapes from the cave. Please output the expectation of D.
Input
The input consists of several cases. In each case, two positive integers N and f (n ≤ 100, f ≤ 10000) are given in the first line. The second line includes N positive integers ci (ci ≤ 10000, 1 ≤ i ≤ N)
Output
For each case, you should output the expectation(3 digits after the decimal point).
Sample Input
3 1 1 2 3
Sample Output
6.889
给出 n 条路，然后每条路有一个c[i]的困难值 和 t[i] 的逃脱天数，一个人的战斗力是 f ，当战斗力大于 c[i] 时， 花t[i]天逃出去，否则下一天随机到另一个地方， 问你这个人期望的走出去的天数是几天。
一开始考虑 dp[i][j] 表示从第 i 个位置出发，战斗力为 j 时的期望逃脱天数。这样可以得到：
1. j > c[i], dp[i][j] = t[i]
2. j <= c[i], dp[i][j] = Σ(dp[k][j+c[i]] + 1) / n
然后去枚举开始的位置，并加上记忆化搜索，感觉是可以的，但是这样做会 T 。
1 /* 2 . 3 ‘;;;;;. 4 ‘!;;;;;;!;` 5 ‘!;|&#@|;;;;!: 6 `;;!&####@|;;;;!: 7 .;;;!&@$$%|!;;;;;;!‘.`:::::‘. 8 ‘!;;;;;;;;[email protected]###&|;;|%!;!$|;;;;|&&;. 9 :!;;;;[email protected]&%|;;;;;;;;;|!::!!:::;!$%;!$%` ‘!%&#########@$!:. 10 ;!;;!!;;;;;|$$&@##$;;;::‘‘‘‘‘::;;;;|&|%@$|;;;;;;;;;;;;;;;;!$; 11 ;|;;;;;;;;;;;;;;;;;;!%@#####&!:::;!;;;;;;;;;;!&####@%!;;;;$%` 12 `!!;;;;;;;;;;!|%%|!!;::;;|@##%|$|;;;;;;;;;;;;!|%$#####%;;;%&; 13 :@###&!:;;!!||%%%%%|!;;;;;||;;;;||!$&&@@%;;;;;;;|$$##$;;;%@| 14 ;|::;;;;;;;;;;;;|&&$|;;[email protected]&$!;;;;!;;;;;;;;;;;;;;;;!%|;;;%@%. 15 `!!;;;;;;;!!!!;;;;;[email protected]@@&&&&&@$!;!%|;;;;!||!;;;;;!|%%%!;;%@|. 16 %&&$!;;;;;!;;;;;;;;;;;|$&&&&&&&&&@@%!%%;!||!;;;;;;;;;;;;;$##! 17 !%;;;;;;!%!:;;;;;;;;;;!$&&&&&&&&&&@##&%|||;;;!!||!;;;;;;;$&: 18 ‘:|@###%;:;;;;;;;;;;;;!%$&&&&&&@@$!;;;;;;;!!!;;;;;%&!;;|&%. 19 [email protected]|;;;;;;;;;;;;;;;;;;|%|$&&$%&&|;;;;;;;;;;;;!;;;;;!&@@&‘ 20 .:%#&!;;;;;;;;;;;;;;!%|$$%%&@%;;;;;;;;;;;;;;;;;;;!&@: 21 .%$;;;;;;;;;;;;;;;;;;|[email protected]&|;;;;;;;;;;;;;;;;;;;;%@%. 22 !&!;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;|@#; 23 `%$!;;;;;;;;;;;[email protected]|;;;;;;;;;;;;;;;;;;;;;;;;!%[email protected]#@|. 24 .|@%!;;;;;;;;;!$&%||;;;;;;;;;;;;;;;;;!%[email protected]#|. 25 ;&$!;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;%#####|. 26 |##$|!;;;;;;::‘‘:;;;;;;;;;;;;;!%[email protected]#@; 27 ;@&|;;;;;;;::‘‘‘‘‘‘:;;;;;;;|$&@###@|` 28 .%##@|;;;;:::‘‘‘‘‘‘‘‘‘‘::;!%&##$‘ 29 `$##@[email protected]@&|!!;;;:‘‘‘‘‘::::;;;;;|&#%. 30 ;&@##&$%!;;;;;;::‘‘‘‘‘‘‘‘::;!|%[email protected]#@&@@: 31 .%@&$$|;;;;;;;;;;:‘‘‘‘:‘‘‘‘::;;;%@#@@#%. 32 :@##@###@$$$$$|;;:‘‘‘‘:;;!!;;;;;;!$#@@#$;` 33 `%@$$|;;;;;;;;:‘‘‘‘‘‘‘::;;;;|%$$|!!&###&‘ 34 |##&%!;;;;;::‘‘‘‘‘‘‘‘‘‘‘‘::;;;;;;;[email protected]&:`!‘ 35 :;[email protected]$|;;;;;;;::‘‘‘‘‘‘‘‘‘‘‘:;;;;;;;;!%&@$: [email protected]#$‘ 36 |##@@&%;;;;;::‘‘‘‘‘‘‘‘‘:;;;;;;;!%&@#@$%: ‘%%!%&; 37 |&%!;;;;;;;%$!:‘‘‘‘‘‘‘:|%!;;;;;;;;|&@%||` ‘%$|!%&; 38 |@%!;;!!;;;||;:‘‘‘‘‘‘:;%$!;;;;!%%%&#&%$&: .|%;:!&%` 39 [email protected]&%;;;;;;;||;;;:‘‘::;;%$!;;;;;;;|&@%;!$; `%&%!!$&: 40 ‘$$|;!!!!;;||;;;;;;;;;;%%;;;;;;;|@@|!$##; !$!;:!$&: 41 |#&|;;;;;;!||;;;;;;;;!%|;;;;!$##$;;;;|%‘ `%$|%%;|&$‘ 42 |&%!;;;;;;|%;;;;;;;;$$;;;;;;|&&|!|%&&; .:%&$!;;;:[email protected]! 43 `%#&%!!;;;;||;;;;;!$&|;;;!%%%@&!;;;!!;;;|%!;;%@$!%@! 44 !&!;;;;;;;;;||;;%&!;;;;;;;;;%@&!;;!&$;;;|&%;;;%@%` 45 ‘%|;;;;;;;;!!|$|%&%;;;;;;;;;;|&#&|!!||!!|%[email protected]@|‘ 46 .!%%&%‘`|$; :|$#%|@#&;%#%. 47 */ 48 #include <map> 49 #include <set> 50 #include <list> 51 #include <ctime> 52 #include <cmath> 53 #include <stack> 54 #include <queue> 55 #include <string> 56 #include <vector> 57 #include <cstdio> 58 #include <bitset> 59 #include <cstdlib> 60 #include <cstring> 61 #include <iostream> 62 #include <algorithm> 63 #define lowbit(x) x & (-x) 64 #define mes(a, b) memset(a, b, sizeof a) 65 #define fi first 66 #define se second 67 #define pii pair<int, int> 68 #define INOPEN freopen("in.txt", "r", stdin) 69 #define OUTOPEN freopen("out.txt", "w", stdout) 70 71 typedef unsigned long long int ull; 72 typedef long long int ll; 73 const int maxn = 1e2 + 10; 74 const int maxm = 2e4 + 10; 75 const int mod = 1e9 + 7; 76 const ll INF = 1e18 + 100; 77 const int inf = 0x3f3f3f3f; 78 const double pi = acos(-1.0); 79 const double eps = 1e-8; 80 using namespace std; 81 82 int n, m; 83 int cas, tol, T; 84 85 int c[maxn]; 86 int t[maxn]; 87 double dp[maxn][maxm]; 88 89 void init() { 90 mes(c, 0); 91 mes(t, 0); 92 mes(dp, 0); 93 } 94 95 void dfs(int id, int f) { 96 if(dp[id][f]) return ; 97 if(f > c[id]) { 98 dp[id][f] = 1.0 * t[id]; 99 return ; 100 } 101 double ans = 0.0; 102 for(int i=1; i<=n; i++) { 103 dfs(i, f+c[id]); 104 ans += dp[i][f+c[id]] + 1.0; 105 } 106 dp[id][f] = ans / n; 107 } 108 109 int main() { 110 while(~scanf("%d%d", &n, &m)) { 111 init(); 112 for(int i=1; i<=n; i++) { 113 scanf("%d", &c[i]); 114 t[i] = (int)((1.0 + sqrt(5.0)) / 2 * c[i] * c[i]); 115 } 116 double ans = 0.0; 117 for(int i=1; i<=n; i++) { 118 dfs(i, m); 119 ans += dp[i][m]; 120 } 121 printf("%.3f ", ans / n); 122 } 123 return 0; 124 }
观察方程发现 dp[i][j] 的 i 每次都要去重复枚举，花费了太多的时间，那么想办法优化掉一维。
dp[i] 表示战斗力为 i 时的期望天数。
然后再去搜索每条路
1. i > c[j], dp[i] += t[j]
2. i <= c[j], dp[i] += dp[i + c[j]] + 1
然后在记忆化搜索，就能过了....
1 /* 2 . 3 ‘;;;;;. 4 ‘!;;;;;;!;` 5 ‘!;|&#@|;;;;!: 6 `;;!&####@|;;;;!: 7 .;;;!&@$$%|!;;;;;;!‘.`:::::‘. 8 ‘!;;;;;;;;[email protected]###&|;;|%!;!$|;;;;|&&;. 9 :!;;;;[email protected]&%|;;;;;;;;;|!::!!:::;!$%;!$%` ‘!%&#########@$!:. 10 ;!;;!!;;;;;|$$&@##$;;;::‘‘‘‘‘::;;;;|&|%@$|;;;;;;;;;;;;;;;;!$; 11 ;|;;;;;;;;;;;;;;;;;;!%@#####&!:::;!;;;;;;;;;;!&####@%!;;;;$%` 12 `!!;;;;;;;;;;!|%%|!!;::;;|@##%|$|;;;;;;;;;;;;!|%$#####%;;;%&; 13 :@###&!:;;!!||%%%%%|!;;;;;||;;;;||!$&&@@%;;;;;;;|$$##$;;;%@| 14 ;|::;;;;;;;;;;;;|&&$|;;[email protected]&$!;;;;!;;;;;;;;;;;;;;;;!%|;;;%@%. 15 `!!;;;;;;;!!!!;;;;;[email protected]@@&&&&&@$!;!%|;;;;!||!;;;;;!|%%%!;;%@|. 16 %&&$!;;;;;!;;;;;;;;;;;|$&&&&&&&&&@@%!%%;!||!;;;;;;;;;;;;;$##! 17 !%;;;;;;!%!:;;;;;;;;;;!$&&&&&&&&&&@##&%|||;;;!!||!;;;;;;;$&: 18 ‘:|@###%;:;;;;;;;;;;;;!%$&&&&&&@@$!;;;;;;;!!!;;;;;%&!;;|&%. 19 [email protected]|;;;;;;;;;;;;;;;;;;|%|$&&$%&&|;;;;;;;;;;;;!;;;;;!&@@&‘ 20 .:%#&!;;;;;;;;;;;;;;!%|$$%%&@%;;;;;;;;;;;;;;;;;;;!&@: 21 .%$;;;;;;;;;;;;;;;;;;|[email protected]&|;;;;;;;;;;;;;;;;;;;;%@%. 22 !&!;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;|@#; 23 `%$!;;;;;;;;;;;[email protected]|;;;;;;;;;;;;;;;;;;;;;;;;!%[email protected]#@|. 24 .|@%!;;;;;;;;;!$&%||;;;;;;;;;;;;;;;;;!%[email protected]#|. 25 ;&$!;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;%#####|. 26 |##$|!;;;;;;::‘‘:;;;;;;;;;;;;;!%[email protected]#@; 27 ;@&|;;;;;;;::‘‘‘‘‘‘:;;;;;;;|$&@###@|` 28 .%##@|;;;;:::‘‘‘‘‘‘‘‘‘‘::;!%&##$‘ 29 `$##@[email protected]@&|!!;;;:‘‘‘‘‘::::;;;;;|&#%. 30 ;&@##&$%!;;;;;;::‘‘‘‘‘‘‘‘::;!|%[email protected]#@&@@: 31 .%@&$$|;;;;;;;;;;:‘‘‘‘:‘‘‘‘::;;;%@#@@#%. 32 :@##@###@$$$$$|;;:‘‘‘‘:;;!!;;;;;;!$#@@#$;` 33 `%@$$|;;;;;;;;:‘‘‘‘‘‘‘::;;;;|%$$|!!&###&‘ 34 |##&%!;;;;;::‘‘‘‘‘‘‘‘‘‘‘‘::;;;;;;;[email protected]&:`!‘ 35 :;[email protected]$|;;;;;;;::‘‘‘‘‘‘‘‘‘‘‘:;;;;;;;;!%&@$: [email protected]#$‘ 36 |##@@&%;;;;;::‘‘‘‘‘‘‘‘‘:;;;;;;;!%&@#@$%: ‘%%!%&; 37 |&%!;;;;;;;%$!:‘‘‘‘‘‘‘:|%!;;;;;;;;|&@%||` ‘%$|!%&; 38 |@%!;;!!;;;||;:‘‘‘‘‘‘:;%$!;;;;!%%%&#&%$&: .|%;:!&%` 39 [email protected]&%;;;;;;;||;;;:‘‘::;;%$!;;;;;;;|&@%;!$; `%&%!!$&: 40 ‘$$|;!!!!;;||;;;;;;;;;;%%;;;;;;;|@@|!$##; !$!;:!$&: 41 |#&|;;;;;;!||;;;;;;;;!%|;;;;!$##$;;;;|%‘ `%$|%%;|&$‘ 42 |&%!;;;;;;|%;;;;;;;;$$;;;;;;|&&|!|%&&; .:%&$!;;;:[email protected]! 43 `%#&%!!;;;;||;;;;;!$&|;;;!%%%@&!;;;!!;;;|%!;;%@$!%@! 44 !&!;;;;;;;;;||;;%&!;;;;;;;;;%@&!;;!&$;;;|&%;;;%@%` 45 ‘%|;;;;;;;;!!|$|%&%;;;;;;;;;;|&#&|!!||!!|%[email protected]@|‘ 46 .!%%&%‘`|$; :|$#%|@#&;%#%. 47 */ 48 #include <map> 49 #include <set> 50 #include <list> 51 #include <ctime> 52 #include <cmath> 53 #include <stack> 54 #include <queue> 55 #include <string> 56 #include <vector> 57 #include <cstdio> 58 #include <bitset> 59 #include <cstdlib> 60 #include <cstring> 61 #include <iostream> 62 #include <algorithm> 63 #define lowbit(x) x & (-x) 64 #define mes(a, b) memset(a, b, sizeof a) 65 #define fi first 66 #define se second 67 #define pii pair<int, int> 68 #define INOPEN freopen("in.txt", "r", stdin) 69 #define OUTOPEN freopen("out.txt", "w", stdout) 70 71 typedef unsigned long long int ull; 72 typedef long long int ll; 73 const int maxn = 1e2 + 10; 74 const int maxm = 1e5 + 10; 75 const int mod = 1e9 + 7; 76 const ll INF = 1e18 + 100; 77 const int inf = 0x3f3f3f3f; 78 const double pi = acos(-1.0); 79 const double eps = 1e-8; 80 using namespace std; 81 82 int n, m; 83 int cas, tol, T; 84 85 int c[maxn]; 86 int t[maxn]; 87 double dp[maxm]; 88 89 void init() { 90 mes(c, 0); 91 mes(t, 0); 92 mes(dp, 0); 93 } 94 95 void dfs(int f) { 96 if(dp[f]) 97 return ; 98 double ans1 = 0.0; 99 double ans2 = 0.0; 100 for(int i=1; i<=n; i++) { 101 if(f > c[i]) { 102 ans1 += 1.0 * t[i]; 103 } else { 104 dfs(f+c[i]); 105 ans2 += dp[f+c[i]]; 106 ans2 += 1.0; 107 } 108 } 109 dp[f] = (ans1 + ans2) / n; 110 } 111 112 int main() { 113 while(~scanf("%d%d", &n, &m)) { 114 init(); 115 for(int i=1; i<=n; i++) { 116 scanf("%d", &c[i]); 117 t[i] = (int)((1.0 + sqrt(5.0)) / 2 * c[i] * c[i]); 118 } 119 dfs(m); 120 printf("%.3f ", dp[m]); 121 } 122 return 0; 123 }
以上是关于he helped me find the cat 为啥过去式在help上，不是found 上？的主要内容，如果未能解决你的问题，请参考以下文章
poj-2996 Help Me with the Game
Tju_Oj_2312Help Me with the Game
Error from server (NotFound): the server could not find the requested resource (get services http:he
POJ-2996 Help Me with the Game---模拟棋子
L181 The microscopic structure of a cat’s tongue helps keep its fur clean
IO 异常：The Network Adapter could not establish the connection 怎么解决