The new algorithm for testnet difficulty after 15 Feb 2012 behaves incorrectly when pblock->nTime < pindexLast->nTime. As both terms are unsigned, the results of the substraction underflows. The result is greater than nTargetSpacing*2, which causes the difficulty to be set to the minimum. I suppose this could be used to mine a lot of blocks in a row at minimum difficulty.
See main.cpp line 835:
// If the new block's timestamp is more than 2* 10 minutes // then allow mining of a min-difficulty block. if (pblock->nTime - pindexLast->nTime > nTargetSpacing*2) return nProofOfWorkLimit;