#420 Div.2 B. Okabe and Banana Trees——数学&暴力
来源:互联网 发布:天津seo平台 编辑:程序博客网 时间:2024/06/05 08:50
题目链接:
http://codeforces.com/contest/821/problem/B
题目大意:
给一个 特定形式的函数表达式 在内部做一个矩形(如图的矩形 分别平行xy轴)
求矩形的价值最大,价值指每个整数点的横纵坐标和即 x+y
分析:
本来想当然肯定是中间最大,后来发现看时间根本不用想, y 从 0 到 b 遍历一遍就好了
计算公式是:
#include <bits/stdc++.h>using namespace std;typedef long long ll;#define mem(s,t) memset(s,t,sizeof(s))#define D(v) cout<<#v<<" "<<v<<endl#define inf 0x3f3f3f3fconst ll N =55;ll a[N][N];//#define LOCALll Max(ll a,ll b){return a>b? a:b;}int main() {#ifdef LOCAL freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);#endif ll m,b; scanf("%lld%lld",&m,&b); ll y=0; ll ans=-1; for(y=0;y<=b;y++){ ll x=m*(b-y); ll sum1=(1+x)*x/2*(y+1)+(1+y)*y/2*(x+1); ans=Max(ans,sum1); } printf("%lld\n",ans); return 0;}
阅读全文
0 0
- #420 Div.2 B. Okabe and Banana Trees——数学&暴力
- CF#420 Div.2 B. Okabe and Banana Trees(数学)
- #420 B. Okabe and Banana Trees(Div.2)
- Codeforces Round #420 (Div. 2) B. Okabe and Banana Trees
- CF#420 B. Okabe and Banana Trees 思维|暴力|几何
- CF #420 B. Okabe and Banana Trees
- codeforces -420-B. Okabe and Banana Trees
- Codefroces 821B Okabe and Banana Trees(暴力)
- Codeforces Round #420 B. Okabe and Banana Trees
- Codeforces 821 B. Okabe and Banana Trees
- codeforces 821 B Okabe and Banana Trees
- Codeforces 821B-Okabe and Banana Trees
- Codeforces#420 Okabe and Banana Trees
- CF821B-Okabe and Banana Trees
- Codeforces821B Okabe and Banana Trees
- Okabe and Banana Trees CodeForces
- Codeforces 821B Okabe and Banana Trees 题解
- #420 Div.2 A. Okabe and Future Gadget Laboratory——暴力
- 初次接触一个新的技术
- [LeetCode] 113. Path Sum II
- 00101 SQL基础——DML
- C++ 标准库(stl) C++ 引入头文件现状和IO流技术概述
- C语言:十八岁生日
- #420 Div.2 B. Okabe and Banana Trees——数学&暴力
- 设置Golang的GOPATH
- android 创建不同的bitmap
- JAVA面向对象
- Ubuntu使用networking服务来管理网络
- hihoCoder挑战赛29
- git常见命令
- 人体生物钟
- 上传app程序时,出现“Authenticating with the iTunes Store...