杂题-贪心
文章平均质量分 65
ruclion
天上一日,地下十年
展开
-
UVALive 6832
更改序列题目描述:N《=15,给出一个1 0串,为初始串,给出一个目标串,操作只有一个,就是交换相邻的两个数字,问初始串变成目标串的最少操作次数。其中目标串给出的方式是:比如1001011 方式为:1 2 1 1 2 这样的对应两个串,挑出一个操作最少的就好。题解:我是想:先把目标串变成两个跑两次,对于每个串,先看1的个数,然后从第一个开始扫,因为只能交换相邻的,所以当前不行就从后面找,一直原创 2015-05-11 09:27:31 · 441 阅读 · 0 评论 -
Sichuan Province 2012 F Fold The Paper
题目描述:F. Fold The PaperTime Limit: 2000msMemory Limit: 65535KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 24254 You have a rectangular piece of paper that is divided原创 2015-10-08 15:08:48 · 358 阅读 · 0 评论 -
Epic Fail of a Genie
题目描述:E. Epic Fail of a GenieTime Limit: Unknown msMemory Limit: 65536KB 64-bit integer IO format: %I64d Java class name: (Any) Submit Status PID: 49355 Input/Output: standard input/outputAladdin原创 2015-10-09 15:19:20 · 378 阅读 · 0 评论 -
Carries
题目描述:题解:当时真是傻.. 首先肯定是按照位来计算,然后麻烦的是进位的计算. 但是但是!! 进位是一个很好搞的东西,排个序,那么比一个特定数大的值都可以进位!!!! 之后就很好写了呗. 可以每次排序,然后二分找,也可以用两个指针o(n)搞重点:想到了进位不会,那么继续探索怎么搞定进位?大于一个数就会进位,那么后面的一段都会进位代码://代码找不到了.....但是实现很简单原创 2015-10-09 15:55:19 · 578 阅读 · 0 评论 -
Just Another Disney Problem
题目描述:J. Just Another Disney ProblemTime Limit: 1000msMemory Limit: 262144KB 64-bit integer IO format: %I64d Java class name: (Any) Submit Status PID: 49360 Input/Output: standard input/outputEvi原创 2015-10-09 15:24:11 · 446 阅读 · 0 评论 -
Problem A. Alter Board
题目描述:Problem A. Alter Board Input file: alter.in Output file: alter.out Little Dima gave his little brother Petya interactive chess board of size n × m as a present. There are many awesome features原创 2015-10-27 18:48:19 · 344 阅读 · 0 评论 -
Problem E. Epic Win!
题目描述:Problem E. Epic Win! Input file: epic.in Output file: epic.out A game of rock-paper-scissors is played by two players who simultaneously show out their moves: Rock, Paper , or Scissors. If the原创 2015-10-27 19:00:50 · 468 阅读 · 0 评论 -
Problem I. Improvements
题目描述:Problem I. Improvements Input file: improvements.in Output file: improvements.out Son Halo owns n spaceships numbered from 1 to n and a space station. They are initially placed on one line wit原创 2015-10-27 19:07:47 · 345 阅读 · 0 评论 -
ASC45 Analogous Sets
题目描述:Problem A. Analogous Sets Input le: analogous.in Output le: analogous.out Time limit: 2 seconds Memory limit: 512 mebibytes For a set A of positive integers let us call A + A a multiset {x原创 2015-11-28 19:36:11 · 451 阅读 · 0 评论 -
2015 Asia - Jakarta D - An ICPC Problem without Statement
题目描述:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=104601#problem/D题解:1.当一定大于等于0的时候,就是我们尽量凑2的时候,我们放2,-2,1, -1, 0的顺序,每次能放就放最多的,和-1的 dfs深搜. 2.当必须是-的时候,要么全部必须要选,要么全是负数(可以推一下) 所以就是绝对值小的.重点:1.负数的时候原创 2016-01-24 22:56:55 · 306 阅读 · 0 评论 -
Equation
题目描述:E. EquationTime Limit: 5000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 3688 Your task is to solve an equation of the form f(x) = 0 where原创 2015-10-08 17:04:28 · 379 阅读 · 0 评论 -
Hanoi Towers
题目描述:H. Hanoi TowersTime Limit: 5000msMemory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 3691 The “Hanoi Towers” puzzle consists of three pegs (that we原创 2015-10-08 17:55:14 · 353 阅读 · 0 评论 -
UVALive 6834
购物 题目描述:给出N个点~1000,就是1到N。然后给出m条边,每个是di到ci,意思是只有到达过di之后到达ci才算到达过ci。求:从1出发,将1到N个点全部搞完然后到N点的总距离。题解:很好的一道题。首先发现区间不连续,不能够用dp。然后研究性质,发现:如果di》ci,就增加一个区间ci到di,表明要额外走双份,这样都处理后,发现如果di《ci是不用弄的,因为所有与di和ci有关的都搞过了。之原创 2015-05-11 09:50:48 · 1395 阅读 · 0 评论 -
Poj1065
套娃或者木棍题目描述:两个参数要求小于等于的套娃,求最少开得列题解:核心其实是一个贪心.在放套娃的时候,只要不出现本来可以放在其中,但是没有放在其中的错误的话,结果一定是最优的.解法一共有两个.第一步都是排序,排序标准:本题是小于等于,因此l升,w也生.一种比较直接,用set维护一个剩余的w的单调的东西,然后往里加的时候找小于它的最大的那个改变就好了.法二:每一找出来一条链把它消除掉.记录一个当前的原创 2015-06-23 16:10:10 · 381 阅读 · 0 评论 -
hdu 5323
暴力 题目大意:给出一个线段树区间,判断使得这个区间合法的最小的n。数据满足:l,r <= 1e9 并且 l / (r – l + 1) <= 2015 这道题的关键在于这个数据,暴搜的话每次有四种情况,但是每一次暴搜,2015这个最大值缩小一半。即是说我们在log2015次即可达到,所以总复杂度是4^(log2015) 重点:给出一个l,r, 我们要找到0到r. 怎么找?不管l到r是不是最后原创 2015-08-02 15:52:04 · 296 阅读 · 0 评论 -
Magic Potions
题目描述:一堆东西,每次拿出两个不同的东西合。要最终合出来的最多。并且要贪心的买12 13 14.。。1n 23.。。 http://codeforces.com/gym/100430/attachments/download/2418/20092010-summer-petrozavodsk-camp-andrew-stankevich-contest-36-asc-36-en.pdf题解:首原创 2015-08-17 10:42:31 · 399 阅读 · 0 评论 -
codeforces 317 B. Minimization
题目描述:You’ve got array A, consisting of n integers and a positive integer k. Array A is indexed by integers from 1 to n.You need to permute the array elements so that value (就是错k个相减)became minimal pos原创 2015-09-09 11:50:08 · 379 阅读 · 0 评论 -
hdu5527 Too Rich
题目描述:Too RichTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 169 Accepted Submission(s): 50Problem Description You are a rich person, and原创 2015-11-03 15:01:09 · 1607 阅读 · 0 评论 -
2014北京 HDU 5113 Black And White
题目描述:In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colo原创 2015-09-16 16:45:00 · 318 阅读 · 0 评论 -
A Big Dinner
题目描述:A. A Big DinnerTime Limit: 1000msMemory Limit: 65535KB 64-bit integer IO format: %lld Java class name: Main Submit Status PID: 24249 As is known to all, an ACM team consists of three member原创 2015-10-08 11:07:31 · 515 阅读 · 0 评论 -
poj3565 Ants
题目描述:AntsTime Limit: 5000msMemory Limit: 65536KB This problem will be judged on PKU. Original ID: 3565 64-bit integer IO format: %lld Java class name: Main Prev Submit Status Statistics Di原创 2015-10-08 16:59:19 · 500 阅读 · 0 评论 -
CF334 div1 D :Ruminations on Ruminants
题目描述:D. Ruminations on Ruminants time limit per test4 seconds memory limit per test256 megabytes inputstandard input outputstandard output Kevin Sun is ruminating on the origin of cows while stand原创 2015-12-06 11:21:09 · 605 阅读 · 0 评论