XPost: comp.lang.asm.x86, comp.lang.pl1   
   From: robin51@dodo.com.au   
      
   "James J. Weinkam"  wrote in message    
   ews:oZrIn.4426$z%6.1359@edtnps83...   
      
   | I believe the program below does what you want and should be a couple of   
   orders of magnitude faster   
   | than the method you outlined (based on your statement about how many "PL/I   
   statements" are executed   
   | on an input of length 2329 with 66 distinct values). For illustrative   
   purposes, the program uses the   
   | character representation you used in your example for input and output, but   
   the algorithm itself   
   | will work for values of c up to 32765 and v up to 32764 if you have enough   
   memory and patience.   
      
   Assuming that it works, a very impressive effort!   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)