#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<cmath> using namespace std; int main() { int m,s,t,now=0; cin>>m>>s>>t; int s1=0,s2=0; for(int i=1;i<=t;i++) { s1+=17; if(m>=10) {s2+=60;m-=10;} else m+=4; if(s2>s1) s1=s2; if(s1>s){ cout<<"Yes"<<endl<<i<<endl; return 0; } } cout<<"No"<<endl<<s1<<endl; }

通过计算，我们可以发现闪现+等CD会比一直跑快，所以能闪现就闪现。走路(PLAN1)和闪现(PLAN2)同时进行，如果PLAN2比PLAN1快，就用PLAN2更新PLAN1。如果PLAN1比PLAN2快，就继续进行。如果PLAN1超过了目标距离，输出"YES"和PLAN1的值。否则输出"NO"和PLAN1的值。 AC代码 欢迎加入团队

能闪则闪，闪烁在能闪时一定比跑的快；分批进行，判断哪个更快；

来一发贪心，能闪就闪。

#include<bits/stdc++.h> #define int long long using namespace std; int m,s,t; signed main(){ cin>>m>>s>>t; int flyS=0,runS=0; for(int i=1;i<=t;i++){ runS+=17; if(m>=10)flyS+=60,m-=10; else m+=4; if(flyS>runS)runS=flyS; if(flyS>s||runS>s){ cout<<"Yes"<<endl<<i; return 0; } }cout<<"No"<<endl<<max(runS,flyS); return 0; }

#include<bits/stdc++.h> using namespace std; const int maxn=1e7+9; int n,m,k,dp[maxn],a1,a2; int main(){ cin>>n>>m>>k; dp[0]=0; for(int i=1;i<=k;i++){ if(n>=10){ a1=max(a1+=17,a2+=60); n-=10; }else{ a1=max(a1+=17,a2); n+=4; } if(a1>m){ cout<<"Yes"<<"\n"<<i; return 0; } } cout<<"No"<<"\n"<<a1; return 0; }

#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<cmath> using namespace std; int main() { int m,s,t,now=0; cin>>m>>s>>t; int s1=0,s2=0; for(int i=1;i<=t;i++) { s1+=17; if(m>=10) {s2+=60;m-=10;} else m+=4; if(s2>s1) s1=s2; if(s1>s){ cout<<"Yes"<<endl<<i<<endl; return 0; } } cout<<"No"<<endl<<s1<<endl; }