코드업

#include int dp[105];int dis[105],t[105];int where[105],ans[105];int main(){ int M,n,sum=0,i,tmp,j,cnt=0; scanf("%d",&M); scanf("%d",&n); for(i=1;i=0;j--) { if(dis[i]-dis[j]dp[j]+t[i]) { dp[i]=dp[j]+t[i]; where[i]=j; } } else break; } } i=where[n+1]..