zoukankan      html  css  js  c++  java
  • URAL1517Freedom of Choice(后缀数组)

    Background

    Before Albanian people could bear with the freedom of speech (this story is fully described in the problem "Freedom of speech"), another freedom - the freedom of choice - came down on them. In the near future, the inhabitants will have to face the first democratic Presidential election in the history of their country.
    Outstanding Albanian politicians liberal Mohammed Tahir-ogly and his old rival conservative Ahmed Kasym-bey declared their intention to compete for the high post.

    Problem

    According to democratic traditions, both candidates entertain with digging dirt upon each other to the cheers of their voters' approval. When occasion offers, each candidate makes an election speech, which is devoted to blaming his opponent for corruption, disrespect for the elders and terrorism affiliation. As a result the speeches of Mohammed and Ahmed have become nearly the same, and now it does not matter for the voters for whom to vote.
    The third candidate, a chairman of Albanian socialist party comrade Ktulhu wants to make use of this situation. He has been lazy to write his own election speech, but noticed, that some fragments of the speeches of Mr. Tahir-ogly and Mr. Kasym-bey are completely identical. Then Mr. Ktulhu decided to take the longest identical fragment and use it as his election speech.

    Input

    The first line contains the integer number N (1 ≤ N ≤ 100000). The second line contains the speech of Mr. Tahir-ogly. The third line contains the speech of Mr. Kasym-bey. Each speech consists of N capital latin letters.

    Output

    You should output the speech of Mr. Ktulhu. If the problem has several solutions, you should output any of them.

    Example

    inputoutput
    28
    VOTEFORTHEGREATALBANIAFORYOU
    CHOOSETHEGREATALBANIANFUTURE
    
    THEGREATAL

    题意:

    找到最长公共子序列并输出。

    灵感:

    这个题只有一个最长公共子序列。如果有多个的时候而且要求最小字典序,可以排序或许建立字典树找到最小字典序的最长公共子序列。

    #include<cstdio>
    #include<cstdlib>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    const int maxn=4100000;
    char str1[maxn],str2[maxn];  
    int L,L1,L2,ch[maxn];
    struct SA
    {
        int cntA[maxn],cntB[maxn],A[maxn],B[maxn];
        int rank[maxn],sa[maxn],tsa[maxn],ht[maxn];
        void sort()
        {
             for (int i = 0; i <= 27; i ++) cntA[i] = 0;
             for (int i = 1; i <= L; i ++) cntA[ch[i]] ++;
             for (int i = 1; i <= 27; i ++) cntA[i] += cntA[i - 1];
             for (int i = L; i; i --) sa[cntA[ch[i]] --] = i;
             rank[sa[1]] = 1;
             for (int i = 2; i <= L; i ++){
                  rank[sa[i]] = rank[sa[i - 1]];
                  if (ch[sa[i]] != ch[sa[i - 1]]) rank[sa[i]] ++;
             }
             for (int l = 1; rank[sa[L]] < L; l <<= 1){
                  for (int i = 0; i <= L; i ++) cntA[i] = 0;
                  for (int i = 0; i <= L; i ++) cntB[i] = 0;
                  for ( int i = 1; i <= L; i ++){
                      cntA[A[i] = rank[i]] ++; 
                      cntB[B[i] = (i + l <= L) ? rank[i + l] : 0] ++;
                  }
                  for (int i = 1; i <= L; i ++) cntB[i] += cntB[i - 1];
                  for (int i = L; i; i --) tsa[cntB[B[i]] --] = i;
                  for (int i = 1; i <= L; i ++) cntA[i] += cntA[i - 1];
                  for (int i = L; i; i --) sa[cntA[A[tsa[i]]] --] = tsa[i];
                  rank[sa[1]] = 1;
                  for (int i = 2; i <= L; i ++){
                       rank[sa[i]] = rank[sa[i - 1]];
                       if (A[sa[i]] != A[sa[i - 1]] || B[sa[i]] != B[sa[i - 1]]) rank[sa[i]] ++;
                  }
             }
        }
        void getht()
        {
             for (int i = 1, j = 0; i <= L; i ++){
                  if (j) j --;
                  while (ch[i + j] == ch[sa[rank[i] - 1] + j]) j ++;
                  ht[rank[i]] = j;
            }
        }
    };
    SA Sa;
    void init()
    {
        scanf("%d",&L1);
        scanf("%s",str1+1);
        scanf("%s",str2+1);
        L1=strlen(str1+1);
        L2=strlen(str2+1);
        for(int i=1;i<=L1;i++) ch[i]=str1[i]-'A'+1;
        ch[L1+1]=27;
        for(int i=1;i<=L2;i++) ch[i+L1+1]=str2[i]-'A'+1;
        L=L1+L2+1; 
    }
    int main()
    {
        init();
        Sa.sort();
        Sa.getht();
        int ans=0,pos=0;
        for(int i = 1; i <= L; i++){
          if((Sa.sa[i]<=L1)!=(Sa.sa[i-1]<=L1))
            if(Sa.ht[i]>ans){
                ans=Sa.ht[i];pos=Sa.sa[i];
            }
        }
        for(int i=pos;i<=pos+ans-1;i++) printf("%c",ch[i]+'A'-1);
        return 0;
    }
  • 相关阅读:
    苏州是新的一线城市拦路虎?
    SAP MM ME57界面看到的供应源跟Source List主数据不一致?
    SAP QM 检验批里样品数量的确定
    SAP QM 检验批里某检验特性的取样数量跟检验计划设置不符?
    SAP QM 主检验特性主数据关键字段解释
    SAP S4HANA TR传输之操作
    SAP QA32试图做UD,系统报错-工厂 BTYC中的 QM 基选设置需要维护
    使用 boost.asio 简单实现 异步Socket 通信
    fedora 28/29 配置 C++ 环境
    gitlab 和 github 配置 SSH Keys
  • 原文地址:https://www.cnblogs.com/hua-dong/p/8021643.html
Copyright © 2011-2022 走看看