Jzzhu and Chocolate - CF 449C 贪心
来源:互联网 发布:个人电脑域名 编辑:程序博客网 时间:2024/05/09 00:08
Jzzhu has a big rectangular chocolate bar that consists of n × m unit squares. He wants to cut this bar exactly k times. Each cut must meet the following requirements:
- each cut should be straight (horizontal or vertical);
- each cut should go along edges of unit squares (it is prohibited to divide any unit chocolate square with cut);
- each cut should go inside the whole chocolate bar, and all cuts must be distinct.
The picture below shows a possible way to cut a 5 × 6 chocolate for 5 times.
Imagine Jzzhu have made k cuts and the big chocolate is splitted into several pieces. Consider the smallest (by area) piece of the chocolate, Jzzhu wants this piece to be as large as possible. What is the maximum possible area of smallest piece he can get with exactlyk cuts? The area of a chocolate piece is the number of unit squares in it.
A single line contains three integers n, m, k (1 ≤ n, m ≤ 109; 1 ≤ k ≤ 2·109).
Output a single integer representing the answer. If it is impossible to cut the big chocolate k times, print -1.
3 4 1
6
6 4 2
8
2 3 4
-1
In the first sample, Jzzhu can cut the chocolate following the picture below:
In the second sample the optimal division looks like this:
In the third sample, it's impossible to cut a 2 × 3 chocolate 4 times.
题意:切k刀后最大的最小块数。
思路:贪心,尽可能多地横着切,或尽可能多地竖着切。
AC代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){ long long l,w,k,num1,num2,ans; scanf("%I64d%I64d%I64d",&l,&w,&k); if(l+w-2<k) printf("-1\n"); else { num1=min(l-1,k); num2=k-num1; ans=(l/(num1+1))*(w/(num2+1)); num2=min(w-1,k); num1=k-num2; ans=max(ans,(l/(num1+1))*(w/(num2+1))); printf("%I64d\n",ans); }}
- Jzzhu and Chocolate - CF 449C 贪心
- (CF#257)C. Jzzhu and Chocolate
- CF# problem 450C Jzzhu and Chocolate
- CODEFORCES 450C Jzzhu and Chocolate <贪心>
- CF Problem 449A Jzzhu and Chocolate
- 449A - Jzzhu and Chocolate 贪心
- Codeforces 449A Jzzhu and Chocolate(贪心)
- CodeForces 449A - Jzzhu and Chocolate(贪心)
- 450C - Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate
- codeforces #257 C题Jzzhu and Chocolate
- Codeforces Round #257 C.Jzzhu and Chocolate
- CF Codeforces Round #257 (Div. 1) A (449A) Jzzhu and Chocolate
- 【杂题】 codeforces 449A Jzzhu and Chocolate
- CodeForces 449-A. Jzzhu and Chocolate
- CodeForces 449A Jzzhu and Chocolate
- Codeforces 449 A Jzzhu and Chocolate
- Android应用程序获得root权限
- 盐城哪里可以设计商标
- UVA - 10917 Walk Through the Forest (最短路+DP)
- POJ2063 Investment 【完全背包】
- tiny210(s5pv210)移植u-boot(基于 2014.4 版本)——编译过程
- Jzzhu and Chocolate - CF 449C 贪心
- virtualbox下的Ubuntu虚拟机的网络连接
- Android开发————Android ListView使用BaseAdapter与ListView的优化
- Codeforces Round #235 (Div. 2) D. Roman and Numbers (数位dp、状态压缩)
- Leetcode 4Sum 性能瓶颈之容器析构
- 大理:夫妻客栈内杀死女儿后投洱海自尽
- sqlserver中删除数据表中重复的数据或是某一列中重复的字段,紧保留一条数据
- 集训日志(三) 动态规划
- OC中的instancetype和id区别