代码搜索：Subsequence
找到约 105 项符合「Subsequence」的源代码
代码结果 105
www.eeworm.com/read/451456/7463511
cpp subsequence.cpp
#include
using namespace std;
int lcs(char A[],char B[],char C[],int n,int m)
{
int i,j,k,len;
int (*L)[11]=new int [11][11];
int (*s)[11]=new int [11][11];
for(i=0;i
www.eeworm.com/read/367177/9767893
java subsequence.java
package PKU;
import java.util.Scanner;
/**
* ID:3061
* @author yhm
*
*/
public class Subsequence {
/**
* @param args
*/
public static void main(String[] args) {
Scanner cin
www.eeworm.com/read/370991/9573637
rtf number_of_subsequence.rtf
www.eeworm.com/read/388569/8600330
cpp 1159 common subsequence.cpp
/*
1159 Common Subsequence
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 5120 K
125 MS 2288 KB 963 B
GUN C++
*/
#include
#include
using namespace std;
www.eeworm.com/read/300587/13904267
cpp 1159 common subsequence.cpp
/*
1159 Common Subsequence
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 5120 K
125 MS 2288 KB 963 B
GUN C++
*/
#include
#include
using namespace std;
www.eeworm.com/read/239889/13248891
cpp longest ordered subsequence2.cpp
#include
struct node{
int x,y;
}a[1000];
int main()
{
int n,i,j,max;
scanf("%d",&n);
for(i=0;i
www.eeworm.com/read/342073/12043655
c sadwt.c
#include "spiht.h"
#include "spihtdecode.h"
static int QccWAVWaveletShapeAdaptiveSynthesis1D(const QccVector input_data,
QccVector output_data,
www.eeworm.com/read/388569/8600194
cpp 1423 greatest common increasing subsequence.cpp
/*
1423 Greatest Common Increasing Subsequence
Time Limit : 1000 ms Memory Limit : 32768 K Output Limit : 256 K
GUN C++
*/
// 时间复杂度 O(n^2), 空间复杂度 O(n^2)
/*
l1为a的大小, l2为b的大小
结果在ans
www.eeworm.com/read/239889/13248872
dsw 10001longest ordered subsequence.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# 警告: 不能编辑或删除该工作区文件！
###############################################################################
Project: "10001Longest Ordere