Balanced Diet Gym - 102220B

【Balanced Diet Gym - 102220B】的更多相关文章

Balanced Diet Gym - 102220B

题目链接:https://vjudge.net/problem/Gym-102220B 题意:每组数据给了 N和M表示有M种类型的糖果,这些糖果一共N个.接下了是 M 组数据,表示如果你选第 i 中糖果,那么你最少选 Li (你也可以不选),再接下来就是 N 行数据,每一行 ai 和 bi 表示这个糖果属于 bi 这个种类的,它的价值是ai.最后让你输出你挑选的糖果的总价值除以你取得糖果中数量最多的那种糖果的数量,然后化成最简分数. 思路:既然我们要选出的分数最大,那么我们就可以直接暴力的去…

bzoj AC倒序

Search GO 说明:输入题号直接进入相应题目,如需搜索含数字的题目,请在关键词前加单引号 Problem ID Title Source AC Submit Y 1000 A+B Problem 10983 18765 Y 1036 [ZJOI2008]树的统计Count 5293 13132 Y 1588 [HNOI2002]营业额统计 5056 13607 1001 [BeiJing2006]狼抓兔子 4526 18386 Y 2002 [Hnoi2010]Bounce 弹飞绵羊 43…

The 13th Chinese Northeast Collegiate Programming Contest

题解: solution Code: A. Apple Business #include<cstdio> #include<algorithm> #include<vector> using namespace std; typedef long long ll; const int N=100010; int Case,len[N],n,m,i,mx,a[N],size[N],tmp[N];ll ans; vector<ll>v[N],f[N]; str…

The 13th Chinese Northeast Collegiate Programming Contest(B C E F H J)

B. Balanced Diet 思路:把每一块选C个产生的价值记录下来,然后从小到大枚举C. #include<bits/stdc++.h> using namespace std; ; typedef long long ll; vector<int> G[maxn]; int l[maxn], a[maxn], b[maxn]; ll dp[maxn]; bool cmp(int a, int b) { return a > b; } int main() { std:…

Codeforces Gym 100803G Flipping Parentheses 线段树+二分

Flipping Parentheses 题目连接: http://codeforces.com/gym/100803/attachments Description A string consisting only of parentheses '(' and ')' is called balanced if it is one of the following. • A string "()" is balanced. • Concatenation of two balance…

Leetcode 笔记 110 - Balanced Binary Tree

题目链接:Balanced Binary Tree | LeetCode OJ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more tha…