Can anybody give some tips about solving greedy problem ? Hash maps is good becouse we can store multiple (in our case - the same) strings at one key, but how to know which one is the same? We must use **L orvector< vector > to mark letters. This problem is well known on the internet, but all algorithms are for small inputs, max legth = 10000. None of them, and none of their optimizations can handle string of 32Mb...Thanks :)
Reportez-vous à notre Notice d'optimisation pour plus d'informations sur les choix et l'optimisation des performances dans les produits logiciels Intel.