LIS 百练2757 LCS UVA10405

来源：互联网发布：淘宝店铺转让价格表编辑：程序博客网时间：2024/05/16 19:40

没想到我现在已经水到了这种程度

#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<cstdlib>#include<queue>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) for(int i=a;i>=b;i--)using namespace std;const int N=1e4+10;int a[N],f[N],n,ans=0;int main(){    while(scanf("%d",&n)!=EOF)    {    fo(i,1,n) {scanf("%d",&a[i]);f[i]=1;}    fo(i,2,n)        for(int j=i-1;j>=1;j--)            if(a[i]>a[j])                f[i]=max(f[i],f[j]+1);    printf("%d\n",*max_element(f+1,f+1+n));    }    return 0;} //nlognint f[N],len=0,a[N],n;int lower_bound(int x){    int l=1,r=len;    while(l<r){        int mid=(l+r)>>1;        if(f[mid]>=a[x]) r=mid;        else l=mid+1;    }    return l;}int main(){    scanf("%d",&n);    fo(i,1,n) scanf("%d",&a[i]);    f[++len]=a[1];    for(int i=2;i<=n;i++){        if(a[i]>f[len]) f[++len]=a[i];        else{            int pos=lower_bound(i);            f[pos]=a[i];        }    }    printf("%d",len);    return 0;}

LCS

#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<cstdlib>#include<queue>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) for(int i=a;i>=b;i--)using namespace std;const int N=1e3+10;  int f[N][N];  int main(){    string a,b;      while(getline(cin,a)){        getline(cin,b);          int n=a.size(),m=b.size();          memset(f,0,sizeof(f));          for(int i=0;i<n;i++)              for(int j=0;j<m;j++){                  if(a[i]==b[j])  f[i][j]=max(f[i][j],f[i-1][j-1]+1);                    else  f[i][j]=max(f[i-1][j],f[i][j-1]);              }          printf("%d\n",f[n-1][m-1]);     }      return 0;  }

0 0