洛谷P1095

P1095 [NOIP 2007 普及组] 守望者的逃离

点击查看代码

#include<bits/stdc++.h>
using namespace std;

int main () { 
    int m, s, t;
    cin >> m >> s >> t;
    vector<int> dp(t + 1);
    for(int i = 1; i <= t; i++) {
        if(m >= 10){
            m -= 10;
            dp[i] = dp[i - 1] + 60;
        } else {
            m += 4;
            dp[i] = dp[i - 1];
        }
    }
    for(int i = 1; i <= t; i++) {
        dp[i] = max(dp[i], dp[i - 1] + 17);
        if(dp[i] >= s) {
            cout << "Yes\n" << i << '\n';
            return 0;
        }
    }
    cout << "No\n" << dp[t] << '\n';
    return 0;
}