- 博客(9)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 A - Frogger
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists’ suns
2017-09-25 21:00:52
282
原创 匈牙利算法讲解与习题练习
讲解：点击这里超详细的入门A - 过山车 HDU - 2063 RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只愿意和linle或LL做partner，P
2017-09-13 18:43:27
4342
原创 F - Silver Cow Party POJ - 3268
http://poj.org/problem?id=3268 One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,
2017-09-07 17:49:27
244
原创 E - Balanced Lineup POJ - 3264
For the daily milking, Farmer John’s N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To keep things s
2017-09-07 17:00:50
286
原创 poj 1144
Network Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14606 Accepted: 6647 DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable network. They are
2017-09-06 20:50:26
161
原创 ZOJ Problem Set - 1610 Count the Colors 线段树
Count the Colors Time Limit: 2 Seconds Memory Limit: 65536 KB Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones. Your task is
2017-09-04 21:55:51
219
原创 L - Mayor's posters POJ - 2528
线段树+离散化处理这里讲一下离散化处理int cnt=1,i;//输入数据 for(i=0;i<2*n;i+=2) { scanf("%d%d",&post[i].x,&post[i+1].x); post[i].id=cnt; post[i+1].id=cnt; cnt+
2017-09-04 19:36:08
230
原创 51Nod - 1287 加农炮
1287 加农炮 题目来源： Codility 基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题 收藏 关注 一个长度为M的正整数数组A，表示从左向右的地形高度。测试一种加农炮，炮弹平行于地面从左向右飞行，高度为H，如果某处地形的高度大于等于炮弹飞行的高度H（A[i] >= H），炮弹会被挡住并落在i - 1处，则A[i - 1] + 1。如果H <= A[
2017-09-04 19:30:51
317
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人