zoj2972Hurdles of 110m
摘要:
dp[i][j]表示在第i段赛道能量为j时所耗最短时间(i=0为第一段)#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;int m,n,ans;int t1[111],t2[111],t3[110],f1[111],f2[111],dp[111][111];const int INF=100000000;int main(){ int cas; scanf("%d",&cas); while(cas--) { scanf(" 阅读全文