USACO 2002 Feb CowCycling
定义dp[i][j][k]为还剩i头牛,跑了j圈,第k分钟,此时领头牛的最大电力,然后用刷表法dp[i][j][k]可以去转移dp[i][j+l][k+1],dp[i-1][j+l][k+1](l然后当j+l>=s时,输出i+1就行了#include#includeint dp[25][105][105];void check(int &x,int y){ i
