1001O(n)算法为啥超时？

Sorry, I can't answer this question. (But I guess Pascal may be a reason)