#include<bits/stdc++.h>
using namespace std;
int f[1000001];   
int main() 
{ 
    int u,d,t,v,e,w,m; 
    cin>>m>>d>>t; 
    f[0]=0; 
    u=17; 
    v=60; 
    w=4; 
    e=10; 
    for(int i=1;i<=t;i++) 
    { 
        if(m>=10) 
        { 
            f[i]=f[i-1]+60; 
            m-=10; 
        } 
        else
        { 
            f[i]=f[i-1]; 
            m+=4; 
        } 
    } 
    for(int i=1;i<=t;i++) 
    { 
        if(f[i]<f[i-1]+17) 
            f[i]=f[i-1]+u; 
        if(f[i]>=d) 
        { 
            cout<<"Yes"<<endl; 
            cout<<i; 
            return 0; 
        } 
    } 
    cout<<"No"<<endl; 
    cout<<f[t]; 
}

全网最容易AC的正解看过来

#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#define cl long long
#define AUTHOR_WATERMARK "2024sng014"
using namespace std;
const int CL=1e6+27;
const int INF=0x3f3f3f3f;
using namespace std;
int m,s,t,walk,jump;


int main()
{
	cin>>m>>s>>t;
	for(int i=1;i<=t;i++)
	{
		walk+=17;
		if(m>=10)
		{
			jump+=60;
			m-=10;
		}
		else
		{
			m+=4;
		}
		walk=max(walk,jump);
		if(walk>=s)
		{
			cout<<"Yes"<<endl<<i;
			return 0;
		}		
	}
	cout<<"No"<<endl<<walk;
	return 0;
}

#include<bits/stdc++.h> using namespace std; int f[1000001]; int main() { int u,d,t,v,e,w,m; cin>>m>>d>>t; f[0]=0; u=17; v=60; w=4; e=10; for(int i=1;i<=t;i++) { if(m>=10) { f[i]=f[i-1]+60; m-=10; } else{ f[i]=f[i-1]; m+=4; } } for(int i=1;i<=t;i++) { if(f[i]<f[i-1]+17) f[i]=f[i-1]+u; if(f[i]>=d){ cout<<"Yes"<<endl; cout<<i; return 0; } } cout<<"No"<<endl; cout<<f[t]; }