
贪心
pioneer 1
如你所说,成为传奇。
展开
-
Tokitsukaze and Multiple
传送门Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 779Accepted Submission(s): 359Problem DescriptionTokitsukaze has a sequence of lengthn, denoted bya.Tokitsukaze can merge two cons...原创 2020-07-29 21:28:18 · 253 阅读 · 0 评论 -
贪心模板题
源自acwing上的模板题1、区间选点 && 2、最大不相交区间的数量#include <iostream>#include <algorithm>using namespace std;const int N=1e5+10;struct node { int l,r;}range[N];bool cmp(node a,no...原创 2019-10-29 20:36:30 · 324 阅读 · 0 评论 -
Summer Vacation
题源:https://atcoder.jp/contests/abc137/tasks/abc137_dTime Limit: 2 sec / Memory Limit: 1024 MBScore :400400pointsProblem StatementThere areNNone-off jobs available. If you take theii-th jo...原创 2019-08-11 21:59:42 · 390 阅读 · 2 评论 -
Crossing River 贪心
传送门参考博客参考博客A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row th...原创 2019-09-26 18:27:52 · 222 阅读 · 0 评论