摘要:
//循环链表#includestruct Monkey{ int ID; Monkey * next;};int main(){ Monkey *link,*monkey,*lastMonkey; int totalMonkeys,stride,count; printf("input tota...
阅读全文
posted @ 2015-07-26 23:56
_noname
阅读(114)
推荐(0)
编辑
摘要:
//最长公共子序列#include#include#define MAX_LEN 1000char sz1[MAX_LEN];char sz2[MAX_LEN];int aMaxLen[MAX_LEN][MAX_LEN];int main(){ scanf("%s%s",sz1,sz2); wh...
阅读全文
posted @ 2015-07-26 22:20
_noname
阅读(67)
推荐(0)
编辑
摘要:
//帮助Jimmy#include#include#include#define MAX_N 1000#define INFINITE 1000000int t,n,x,y,max;struct Platform{ int Lx,Rx,h;};Platform aPlatform[MAX_N+1...
阅读全文
posted @ 2015-07-26 20:48
_noname
阅读(134)
推荐(0)
编辑
摘要:
//最长上升子序列#include#include#define MAX_N 1000int b[MAX_N+10];int aMaxLen[MAX_N+10];int main(){ int N; int i=0,j=0; scanf("%d",&N); for(i=1;ib[j]){ ...
阅读全文
posted @ 2015-07-26 00:50
_noname
阅读(72)
推荐(0)
编辑