- 博客(7)
- 收藏
- 关注
原创 POJ 3190(Stall Reservations 区间贪心)
/*给出n个牛的挤奶区间 *一头牛在那个时间必须占用一个牛棚,每个牛棚至多一头牛生产 *问最少准备的牛棚数 */#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespac
2016-03-29 23:44:05 643
原创 POJ 3187(Backward Digit Sums 穷竭搜索,杨辉三角性质)
//题意略#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair P;const int
2016-03-28 22:57:15 474
原创 POJ 3050(Hopscotch 穷竭搜索)
/*给一个5*5的矩阵 *从某一个位置开始能够向上下左右走 *求所有走了6步后,走过的矩阵元素(数字)的序列 */#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespa
2016-03-28 22:53:16 425
原创 Aizu 0525(Osenbei 穷竭搜索)
/* 翻煎饼,1正面朝上,0反面朝上, * 每次可翻某一行或者某一列 * 问最大正面朝上数 */#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;t
2016-03-28 22:46:40 452
原创 POJ 1328(Radar Installation 区间贪心)
/*雷达安在x轴上 *给出n个岛的坐标 *求最少能覆盖所有岛的雷达数 */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typ
2016-03-28 22:41:30 386
原创 POJ 2376 Cleaning Shifts 区间贪心
#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair P;const int INF=0
2016-03-28 21:41:03 396
原创 POJ 3009 Curling 2.0 (dfs)
调了接近两个小时 不容易啊,索性写个博客惩罚一下自己。题目大意:溜冰壶,冰壶有起点终点,问由起点到终点最小投掷数,最小投掷数大于10或者终点不可达输出-1冰壶一旦投掷,会朝着一个方向行走,知道滑出平台、撞到石块或到达终点。撞到石块会停并且石块消失。思路:DFS枚举投掷方向即可,不用标记是否走过(因为有石块的影响)#include#include
2016-03-25 19:06:16 688
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人