wuzhibin

摘要： /*This Code is Submitted by billforum for Problem 1965 at 2012-02-06 21:00:43*/#include <iostream>using namespace std;const int NUM=1442;//the number of the most carsint m[NUM+1],step[NUM+1],tmp[NUM+1],pre[NUM+1];int max(int x,int y){ return(x>y?x:y);}int main(int args,char** argv){ in... 阅读全文