随缘&不屈 - 博客园

UVA1153-Keep the Customer Satisfied（贪心）

摘要： Problem UVA1153-Keep the Customer Satisfied Accept: 222 Submit: 1706Time Limit: 3000 mSec Problem Description Input The input begins with a single pos 阅读全文

posted @ 2018-09-22 23:59 随缘&不屈阅读(467) 评论(0) 推荐(0) 编辑

UVA1613-K-Graph Oddity（贪心）

摘要： Problem UVA1613-K-Graph Oddity Accept: 108 Submit: 884Time Limit: 3000 mSec Problem Description Input The input will contain several test cases, each 阅读全文

posted @ 2018-09-21 20:23 随缘&不屈阅读(504) 评论(0) 推荐(0) 编辑

UVA11925-Generating Permutations（贪心）

摘要： Problem UVA11925-Generating Permutations Accept: 214 Submit: 1429Time Limit: 1000 mSec Problem Description A permutation on the integers from 1 to n i 阅读全文

posted @ 2018-09-21 12:02 随缘&不屈阅读(236) 评论(0) 推荐(0) 编辑

UVA11491-Erasing ans Winning(贪心)

摘要： Problem UVA11491-Erasing ans Winning Accept: 799 Submit: 5753Time Limit: 3000 mSec Problem Description Juliano is a fan of the TV show Erasing and Win 阅读全文

posted @ 2018-09-21 00:45 随缘&不屈阅读(375) 评论(0) 推荐(0) 编辑

UVA12545-Bits Equalizer（思维）

摘要： Problem UVA12545-Bits Equalizer Accept: 821 Submit: 4548Time Limit: 3000 mSec Problem Description Input The ﬁrst line of input is an integer C (C ≤ 20 阅读全文

posted @ 2018-09-20 22:13 随缘&不屈阅读(294) 评论(0) 推荐(0) 编辑

UVA12265-Selling Land（细节处理）

摘要： Problem UVA12265-Selling Land Accept: 309 Submit: 3231Time Limit: 3000 mSec Problem Description Input There may be multiple test cases in the input. E 阅读全文

posted @ 2018-09-20 20:47 随缘&不屈阅读(295) 评论(0) 推荐(0) 编辑

UVA12265-Selling Land（单调栈）

摘要： Problem UVA12265-Selling Land Accept: 137 Submit: 782Time Limit: 3000 mSec Problem Description Input On the ﬁrst line a positive integer: the number o 阅读全文

posted @ 2018-09-20 01:48 随缘&不屈阅读(255) 评论(0) 推荐(0) 编辑

UVA1442-Cav（扫描法）

摘要： Problem UVA1442-Cav Accept: 185 Submit: 679Time Limit: 3000 mSec Problem Description Input The input contains several test cases. The ﬁrst line of the 阅读全文

posted @ 2018-09-20 00:35 随缘&不屈阅读(863) 评论(0) 推荐(0) 编辑

UVA1609-Foul Play（构造+递归）

摘要： Problem UVA1609-Foul Play Accept: 101 Submit: 514Time Limit: 3000 mSec Problem Description Input For each test case, the input is as follows: • One li 阅读全文

posted @ 2018-09-19 23:37 随缘&不屈阅读(636) 评论(2) 推荐(0) 编辑

UVA1608-Non-boring sequences（分治）

摘要： Problem UVA1608-Non-boring sequences Accept: 227 Submit: 2541Time Limit: 3000 mSec Problem Description We were afraid of making this problem statement 阅读全文

posted @ 2018-09-19 20:52 随缘&不屈阅读(954) 评论(1) 推荐(0) 编辑