Cod sursa(job #1727816)

Utilizator TiiberiuBujor Tiberiu-Cosmin Tiiberiu Data 11 iulie 2016 17:35:00
Problema Potrivirea sirurilor Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.38 kb
#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
 
const int BIG = 2000005;
char sir_total[BIG],sir_comparat[BIG];
int KMP[BIG],poz[BIG];
 
int main() {
     
    int n,m,k=0,j=0,index = 0;
    int z=0;
     
    freopen("imp.in", "r", stdin);
    freopen("imp.out", "w", stdout);
     
   scanf("%s%s",sir_comparat,sir_total);
    
   n  = strlen(sir_total+1);
   m  = strlen(sir_comparat+1);
    
   if(n < m){
        printf("%d\n",0);
        fclose(stdin);
        fclose(stdout);
    } 
   
   for(int i=1;i<=m;){
   
       if(sir_comparat[i] == sir_comparat[index]){
    
           KMP[i] = index+1;
           index++;
           i++;}
       else{
           if(index)
               index = KMP[index-1];
           else{
              
               KMP[i] = 0;
                //cout<<KMP[i];
               i++;
           }
       }
   }

   while(k < n){
  
       if(j == m-1){
           poz[z] = k-j;
           z++;
           j=0;    
       }   
       if(sir_total[k] == sir_comparat[j]){
           k++;
           j++;
       }
       else{
           if(j){
               j = KMP[j-1];
           }
           else
               k++;
       }
       
   }
  
   printf("%d\n",z-1);
    z = min(z, 1000);
   for(int i=1;i<z;i++)
 printf("%d ",poz[i]);
    
    return 0;
        
}