[NWPU] [2014] [TRN] [6] [0716] simple linear dp, nwputrn
Dynamic Planning basics.
Competition address:
Http://vjudge.net/contest/view.action? Cid = 49759 # overview
Questions, questions, WA points, and questions
ID |
Origin |
Title |
WA point |
Question |
Problem |
POJ 1887 |
Simple dp example |
PE... |
Http://blog.csdn.net/polossk/article/details/37947525 |
Problem B |
POJ 1163 |
Simple dp example |
Careful array out-of-bounds |
Http://blog.csdn.net/polossk/article/details/37947753 |
Problem C |
POJ 1458 |
Simple dp example |
Careful array out-of-bounds |
Http://blog.csdn.net/polossk/article/details/37948255 |
Problem D |
HDU 1003 |
Simple dp example |
Node update |
Http://blog.csdn.net/polossk/article/details/37949405 |
Problem E |
POJ 1088 |
Simple dp example |
Border Processing |
Http://blog.csdn.net/polossk/article/details/37948445 |
Problem F |
POJ 1157 |
Simple dp |
Initial Value settings |
Http://blog.csdn.net/polossk/article/details/37948603 |
Problem G |
POJ 2479 |
Simple dp example Extension |
Value assignment when retrieving answers |
Http://blog.csdn.net/polossk/article/details/37948737 |
Problem H |
POJ 1159 |
Simple dp example Extension |
Process subscript to prevent out-of-bounds |
Http://blog.csdn.net/polossk/article/details/37948861 |
Problem I |
HDU 1421 |
Simple dp |
The INF value is greater. |
Http://blog.csdn.net/polossk/article/details/37949583 |
Problem J |
HDU 1087 |
Simple dp example Extension |
Note the differences with general questions |
Http://blog.csdn.net/polossk/article/details/37949747 |
Problem K |
POJ 2385 |
Simple dp |
Initial Value settings |
Http://blog.csdn.net/polossk/article/details/37949011 |
Problem L |
POJ 1083 |
Simple dp |
Value assignment when retrieving answers |
Http://blog.csdn.net/polossk/article/details/37949167 |