搜索资源列表
poj1990
- poj上第1990题目源码，用到了2个树状数组，这题数据结构是关键，想到了题目就很简单了-poj first topic FOSS 1990, used the two tree arrays, which that data structure is the key, think of a very simple topic
1915
- poj1915求移动棋子到特定位置的最少次数,BFS经典题目-poj1915 for mobile pawn to a specific location of the minimum number, BFS Classic Title
POJ_1691_1170_3280_2029_1925
- POJ上的几道DP题，小弟刚学，各位大牛勿见笑-POJ on the DP with a few questions, little brother just learning, you big cow Do not laughed
ACMPOJ
- ACM POJ题目 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.c-ACM POJ 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.cpp