string 操作

#include<bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    string s1="what about to ask ",s2="Mike telephone number";
    //1
    s1.replace(11,16,"asking");
    cout<<s1<<endl;
    
    //2
    s2=s2.insert(5,"for ");
    cout<<s2<<endl;
    
    //3
    string s=s1+s2;
    cout<<s<<endl;
    
    //4
    if(s2.find("Mike")!=s2.npos){
        cout<<true<<endl;
    }
    else{
        cout<<false<<endl;
    }
    
    if(s.find("Mike")!=s.npos){
        cout<<true<<endl;
    }
    else{
        cout<<false<<endl;
    }
    
    //5
    if(s2.find("z")!=s2.npos){
        cout<<true<<endl;
    }
    else{
        cout<<false<<endl;
    }
    
    return 0;
}

 

 

最长公共子序列：

#include<bits/stdc++.h>
using namespace std;
const int N=1010;
string s1,s2;
int len1,len2,f[N][N];
int main(){
    ios::sync_with_stdio(false);
    cin>>s1>>s2;
    len1=s1.length();
    len2=s2.length();
    for(int i=1;i<=len1;i++){
        for(int j=1;j<=len2;j++){
            if(s1[i-1]==s2[j-1]) f[i][j]=f[i-1][j-1]+1;
            else f[i][j]=max(f[i-1][j],f[i][j-1]);
        }
    }
    cout<<f[len1][len2];
    return 0;
}

 

最长上升子序列：

#include<bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    int a[10005];
    int dp[10005];
    int n=1,lt,rt,mid;
    int max;
    while(cin>>a[n]) n++;
    max=1;
    dp[max]=a[1];
    for(int i=2;i<n;i++){
        if(a[i]>dp[max]){
            max++;
            dp[max]=a[i];
        }else{
            lt=1;
            rt=max;
            while(lt<rt){
                mid=(lt+rt)/2;
                if(a[i]>dp[mid]){
                    lt=mid+1;
                } else{
                    rt=mid;
                }
            }
            dp[lt]=a[i];
        }
    }
    for(int i=1;dp[i]!=0;i++){
        cout<<dp[i]<<" ";
    }
    return 0;
}