Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
初始化边界注意一下原先的初始化代码 int *clean_begin, *clean_end; clean_begin=&dp[1][1]; clean_end=&dp[100][101]; while (clean_begin!=clean_end) { *clean_begin=INT_MIN; ++clean_begin; } 正确的 int *clean_begin, *clean_end; clean_begin=&dp[1][0];//这里有改动 clean_end=&dp[100][101]; while (clean_begin!=clean_end) { *clean_begin=INT_MIN; ++clean_begin; } 相信大家知道为什么的要放置成[1][0]吧 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator