子序列的XXX
文章平均质量分 66
Lancelot_L
No one say the job was supposed to be easier.
展开
-
最大子序列和(包括路径记录)
#include #include using namespace std;#define MAX 999#define BIG 101int a[BIG];void max_sum(int a[],int n){int maxsum = 0;int nowsum = 0;///////////////int nowhead=0;in原创 2016-12-05 20:34:10 · 336 阅读 · 0 评论 -
最长递增子序列(包含路径记录)
#include #include using namespace std;#define MAX 999#define BIG 101int a[BIG];void max_sum(int a[],int n){int nowleng = 1;int maxleng = 1;int nowhead = 0;int maxhead原创 2016-12-05 20:36:09 · 718 阅读 · 0 评论 -
最长公共子序列(略有瑕疵,要复习,不管了)
#include #include using namespace std;#define MAX 999#define BIG 101char ca[BIG];char cb[BIG];int map[BIG][BIG];int dire[BIG][BIG]; //记录上一个重合点在此时的方向???stack mark;void原创 2016-12-06 20:32:20 · 280 阅读 · 0 评论