贪心算法
DouglasConnor
这个作者很懒,什么都没留下…
展开
-
UVA - 11389 贪心算法
Ignatius and the Princess IIn a city there are n bus drivers. Also there are n morning bus routes and n afternoon bus routes withvarious lengths. Each driver is assigned one morning route and one ev...原创 2019-01-26 09:09:51 · 306 阅读 · 0 评论 -
uva10020 区间完全覆盖
Given several segments of line (int the X axis) with coordinates [Li, Ri]. You are to choose the minimal amount of them, such they would completely cover the segment [0, M].InputThe first line is th...原创 2019-05-24 23:08:48 · 209 阅读 · 0 评论 -
UVA - 10382 Watering Grass区间完全覆盖问题
n sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkleris installed at the horizontal center line of the strip. For each sprinkler we are given its p...原创 2019-05-25 20:49:41 · 156 阅读 · 0 评论 -
Codeforces 597B - Restaurant 贪心算法
Restauranttime limit per test 4 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputA restaurant received n orders for the rental. Each rental order reserve the re...原创 2019-05-18 16:15:59 · 208 阅读 · 0 评论 -
UVA410(贪心)
The International Space Station contains many centrifuges in its labs. Each centrifuge will have somenumber © of chambers each of which can contain 0, 1, or 2 specimens. You are to write a programwh...原创 2019-06-01 22:14:56 · 206 阅读 · 0 评论 -
codeforce1165E Two Arrays and Sum of Functions
问题链接(https://codeforces.com/problemset/problem/1165/E)问题分析给出f(l,r)的公式为f(l,r)=∑l<=i<=r aibi,现在要可以改变bi的次序,但ai不变,求∑1<=l<=r<=n f(l,r)的最小值。设要求的值为sum=∑1<=l<=r<=n ∑l<=i<=r ai...原创 2019-07-18 22:28:21 · 224 阅读 · 0 评论 -
codeforce1194B Yet Another Crosses Problem
问题链接(https://codeforces.com/problemset/problem/1194/B)问题描述给了一个图,白方块用’.‘表示,黑方块用’*'表示。问至少要改变多少个白方块为黑方块才能使图中有一个“十字”(黑色方格铺满某一行和某一列)问题分析找到所有行和列中白色方格最少的行和列对应的白方格数,这时会有两种情况:这样的行和列的交点处可能是黑方格,计数的时候可以直接相加;也...原创 2019-07-20 23:09:48 · 345 阅读 · 0 评论 -
牛客 栈与排列 模拟
链接:https://ac.nowcoder.com/acm/problem/14893来源:牛客网时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 131072K,其他语言262144K64bit IO Format: %lld题目描述给你一个1->n的排列和一个栈,入栈顺序给定你要在不打乱入栈顺序的情况下,对数组进行从大到小排序当无法完全排序时,请输出字典序最...原创 2019-08-02 22:07:25 · 455 阅读 · 0 评论 -
POJ3903 Stock Exchange 最长上升子序列
Stock ExchangeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9901 Accepted: 3430DescriptionThe world financial crisis is quite a subject. Some people are more relaxed while others are...原创 2019-07-31 21:49:25 · 269 阅读 · 0 评论