codeforces 735C Tennis Championship 思维+递推
来源:互联网 发布:python aes ecb 编辑:程序博客网 时间:2024/05/13 19:41
点击打开链接
题意:两个人能比赛要求胜场差<=1 输得人淘汰不再比赛 求n(n<=1e18)个人比赛 冠军最多能赢几场
转换一下思维 令f[x]为冠军赢x场比赛时最少的参赛人数,则f[x]=f[x-1]+f[x-2] (让赢x-1场的去赢x-2场的)
输入n 二分找到n>=f[x]的最大x即可
#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>typedef long long ll;using namespace std;const int N=1e5+20;ll f[N];int main(){f[1]=2;f[2]=3;int x;for(x=3;;x++)//fib增长很快 {f[x]=f[x-1]+f[x-2];if(f[x]>1e18)break;}int l=1,r=x,ans;ll n;cin>>n;while(l<=r){int mid=(l+r)/2;if(n>=f[mid]){ans=mid;l=mid+1;}elser=mid-1;}cout<<ans<<endl;return 0;}
0 0
- codeforces 735C Tennis Championship 思维+递推
- CodeForces 735C - Tennis Championship(递推)
- Codeforces#382(Div. 2) C.Tennis Championship【递推】
- codeforces 735c Tennis Championship
- CodeForces 735C Tennis Championship
- codeforces 735 C Tennis Championship
- CodeForces 735C Tennis Championship
- Codeforces Round #382 (Div. 2)-735C. Tennis Championship(递推)
- codeforces 735C/382.2.C Tennis Championship
- Codeforces 735C - Tennis Championship 规律
- codeforces 735 C. Tennis Championship (数学)
- 【Codeforces 735 C Tennis Championship】+ 贪心
- CodeForces 735 C.Tennis Championship(水~)
- Codeforces Round #382 (Div. 2) C. Tennis Championship 递推、斐波拉契数列
- Codeforces Round #382 (Div. 2)C. Tennis Championship(递推,斐波那契)
- Codeforces Round #382C. Tennis Championship(递推+斐波那契数列)
- 735C Tennis Championship
- Codeforces Round #382 (Div. 1) A. Tennis Championship(递推)
- 蓝桥杯 历届试题 带分数
- Tomcat web-INF目录介绍、部分配置介绍
- MySQL 性能优化总结
- C# 中的委托和事件
- Codeforces#382(Div. 2) D.Taxes【哥德巴赫猜想】
- codeforces 735C Tennis Championship 思维+递推
- .NET中各种数据库连接大全(1)
- tensorflow读取数据到队列当中
- Content-Type Header Field
- .NET中各种数据库连接大全(2)
- Unity 关于资源加载的时间消耗
- 用例图
- IO模型
- 数据类型(2)