- Category:
- AI-NN-PR
- Tags:
-
- File Size:
- 256kb
- Update:
- 2017-12-20
- Downloads:
- 0 Times
- Uploaded by:
- 马泽荣
Description: Using f[i][j] to represent the minimum cost from I to j will turn I from J to i->z->j, K represents the number of sites to go, and the initial location is I, so the end point is i+k, which ensures the last segment is k, so the cycle ends to i<=n-k, and the middle point is the middle. If this is smaller than f[i][j], exchange values
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 3-6
|
| 3-6\3-6.cbp | 1059 | 2017-11-29
|
| 3-6\3-6.depend | 101 | 2017-11-29
|
| 3-6\3-6.layout | 321 | 2017-11-30
|
| 3-6\bin
|
| 3-6\bin\Debug
|
| 3-6\bin\Debug\3-6.exe | 967597 | 2017-11-29
|
| 3-6\main.cpp | 653 | 2017-11-29
|
| 3-6\obj
|
| 3-6\obj\Debug
|
| 3-6\obj\Debug\main.o | 12309 | 2017-11-29 |
Download