贪心算法
「已注销」
这个作者很懒,什么都没留下…
展开
-
POJ2287 HDU1052 UVA1344 UVALive3266 ZOJ2397 Tian Ji -- The Horse Racing【贪心】
Tian Ji -- The Horse RacingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 15776 Accepted: 4864DescriptionHere is a famous story in Chinese history. That was about 2300 years ago. General Ti...转载 2018-04-10 16:55:27 · 156 阅读 · 0 评论 -
UVA10954
Problem FAdd AllInput: standard inputOutput: standard outputYup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++ program jus...转载 2018-04-10 17:15:29 · 158 阅读 · 0 评论 -
Uva 1065
点击打开链接#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int N = 10000 + 5;struct wood { int l; int w;}p[N];int vis[N];int cmp (wood a ,wood b...原创 2018-04-10 17:21:39 · 120 阅读 · 0 评论 -
选择不想交区间
贪心模板如下#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 10005;struct Node { int l, r;}p[N];bool cmp(Node a, Node b) { return a.r ...原创 2018-09-10 12:42:39 · 130 阅读 · 0 评论 -
Fabled Rooks UVA - 11134
很不错的题,利用贪心解决代码参考别人的#include<iostream>#include<cmath>#include<cstdio>#include<cstdlib>#include<cstring>#include<iomanip>#include<assert.h>#include&原创 2018-09-10 15:45:42 · 139 阅读 · 0 评论