守望者的逃离（贪心+动规

 

https://www.luogu.org/problemnew/show/P1095

 

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<cmath>
#include<set>
#include<vector>
#include<stack>
#include<queue>
#include<map>
using namespace std;
#define ll long long
#define mem(a,x) memset(a,x,sizeof(a))
#define se second
#define fi first
const int INF= 0x3f3f3f3f;
const int N=3e5+5;

int  m,s,t,dp[N];

int main()
{
    cin>>m>>s>>t;
    mem(dp,0);
    for(int i=1;i<=t;i++)
    {
        if(m>=10)
            dp[i]=dp[i-1]+60,m-=10;
        else
            dp[i]=dp[i-1],m+=4;
    }
    for(int i=1;i<=t;i++)
    {
        if(dp[i]<dp[i-1]+17)
            dp[i]=dp[i-1]+17;//m+=10;或者m-=4; 按理说要写，但后面没用到m，所以可不写
        if(dp[i]>=s)
        {
            cout<<"Yes"<<endl;
            cout<<i;
            return 0;
        }
    }
    cout<<"No"<<endl;
    cout<<dp[t];
}