![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
日常总结
文章平均质量分 82
丶先森
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #401 (Div. 2) D. Cloud of Hashtags
D. Cloud of Hashtagstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is an administrator of a public原创 2017-10-09 22:39:09 · 204 阅读 · 0 评论 -
POJ3671Dining Cows(LIS)
Dining CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8420 Accepted: 3538DescriptionThe cows are so very silly about their dinner partners. They ha原创 2017-04-20 22:10:12 · 492 阅读 · 0 评论 -
POJ3673Cow Multiplication(水)
Cow MultiplicationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13399 Accepted: 9371DescriptionBessie is tired of multiplying pairs of numbers the usu原创 2017-04-16 21:45:21 · 235 阅读 · 0 评论 -
HDU - 5025 2014 ACM/ICPC Asia Regional Guangzhou Online D题Saving Tang Monk(BFS+优先队列)
Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2533 Accepted Submission(s): 890Problem Description《Journey to th原创 2017-04-19 22:16:34 · 543 阅读 · 0 评论 -
POJ2395Out of Hay(最小生成树Kruskal模板)
Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16495 Accepted: 6460DescriptionThe cows have run out of hay, a horrible event that must be rem原创 2017-04-14 21:06:12 · 264 阅读 · 0 评论 -
Codeforces Round #408 (Div. 2) C. Bank Hacking
C. Bank Hackingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlthough Inzane successfully found his belo原创 2017-04-14 15:26:56 · 632 阅读 · 0 评论 -
POJ1159Palindrome(区间dp回文串最长公共子序列+滚动数组模板)
PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 62457 Accepted: 21761DescriptionA palindrome is a symmetrical string, that is, a string read i原创 2017-04-05 22:26:29 · 563 阅读 · 0 评论 -
POJ - 1050 To the Max(区间DP最大字串和,最大子矩阵和模板)
To the MaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48400 Accepted: 25619DescriptionGiven a two-dimensional array of positive and negative integer原创 2017-04-05 22:17:27 · 475 阅读 · 0 评论 -
Codeforces Round #408 (Div. 2) B.Find The Bone(模拟)
B. Find The Bonetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZane the wizard is going to perform a magi原创 2017-04-13 19:53:20 · 482 阅读 · 0 评论 -
Codeforces Round #237 (Div. 2) D. Minesweeper 1D
D. Minesweeper 1Dtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputGame "Minesweeper 1D" is played on a line原创 2017-04-28 15:30:34 · 409 阅读 · 0 评论 -
POJ3669Meteor Shower(bfs)
Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19078 Accepted: 4951DescriptionBessie hears that an extraordinary meteor shower is coming;原创 2017-04-12 17:03:49 · 201 阅读 · 0 评论 -
POJ3668Game of Lines(数学问题)
Game of LinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7046 Accepted: 2638DescriptionFarmer John has challenged Bessie to the following game: FJ h原创 2017-04-12 20:54:40 · 507 阅读 · 1 评论 -
POJ2063Investment
InvestmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10506 Accepted: 3693DescriptionJohn never knew he had a grand-uncle, until he received the not原创 2017-04-01 23:58:36 · 233 阅读 · 0 评论 -
2015-2016 ACM-ICPC Southwestern Europe Regional Contest (SWERC 15) A题Promotions
题目大意:给你一个DAG关于1到(E-1)个数字,然后有一个[A,B]的区间,让你给其中一些人升职,但是升职的前提是需要给他的上级升职,也就是说1->2意味着当你要给2升职的之前,先让他的上级1升职,然后问的是,要想让A个人升职时肯定要升职的人数是多少,让B个人升职肯定升职的人数,然后再输出给即使给B个人升职,也升职不到的人数有几个 解题思路:要想算出肯定升值的人,肯定要找出来有多少原创 2017-03-30 21:37:22 · 1730 阅读 · 0 评论 -
POJ3670Eating Together(LIS最长(非)上升(下降)子序列模板)
Eating TogetherTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6034 Accepted: 2941DescriptionThe cows are so very silly about their dinner partners. The原创 2017-04-10 21:45:40 · 431 阅读 · 0 评论 -
POJ3268 Silver Cow Party(最短路问题)
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21730 Accepted: 9923DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2017-05-03 22:02:22 · 240 阅读 · 0 评论 -
数据结构二叉树——前中后序深度子节点个数
#include#include#include#include#includeusing namespace std;struct point{ string str; int lson, rson;}p[1000005];vector aa[1000005];int sum;int ans;void create(int x,int y){ string st原创 2017-05-03 22:52:05 · 224 阅读 · 0 评论 -
2017 Multi-University Training Contest - Team 9 Numbers (实力乱搞)
NumbersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 61 Accepted Submission(s): 25Problem Descriptionzk has n numbers a1,a2,.原创 2017-08-22 18:08:16 · 363 阅读 · 0 评论 -
AtCoder Beginner Contest 067 D - Fennec VS. Snuke(树上DFS,博弈)
D - Fennec VS. SnukeTime limit : 2sec / Memory limit : 256MBScore : 400 pointsProblem StatementFennec and Snuke are playing a board game.On the board, there are N cells numbered原创 2017-07-28 15:39:08 · 386 阅读 · 0 评论 -
HDU6045 2017 Multi-University Training Contest - Team 2 A - Is Derek lying?
Is Derek lying?Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 330 Accepted Submission(s): 199Problem DescriptionDerek and Alfi原创 2017-07-27 22:02:39 · 284 阅读 · 0 评论 -
Codeforces Round #182 (Div. 1)D. Yaroslav and Divisors
D. Yaroslav and Divisorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYaroslav has an array p = p1, p2,原创 2017-07-27 10:31:25 · 275 阅读 · 0 评论 -
2017 Multi-University Training Contest - Team 1 B - Balala Power! (思维代码能力,贪心)
Talented Mr.Tang has nn strings consisting of only lower case characters. He wants to charge them with Balala Power (he could change each character ranged from a to zinto each number ranged from 0 t原创 2017-07-26 21:51:03 · 454 阅读 · 0 评论 -
Codeforces Round #191 (Div. 2) C. Magic Five(数学,逆元取膜模板)
C. Magic Fivetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a long plate s containing n digits.原创 2017-07-24 14:37:08 · 219 阅读 · 0 评论 -
Codeforces Round #141 (Div. 2)E. The Road to Berland is Paved With Good Intentions(2-SAT模板题)
E. The Road to Berland is Paved With Good Intentionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland原创 2017-07-24 14:25:22 · 302 阅读 · 0 评论 -
AtCoder Grand Contest 015 C.Nuske vs Phantom Thnook
C - Nuske vs Phantom ThnookTime limit : 4sec / Memory limit : 256MBScore : 700 pointsProblem StatementNuske has a grid with N rows and M columns of squares. The rows are numbered 1原创 2017-05-28 17:14:26 · 480 阅读 · 0 评论 -
POJ1144Network(割边模板题)
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13771 Accepted: 6257DescriptionA Telephone Line Company (TLC) is establishing a new telephone cab原创 2017-05-08 21:07:03 · 856 阅读 · 0 评论 -
The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple C题What Kind of Fri
What Kind of Friends Are You?Time Limit: 1 Second Memory Limit: 65536 KBJapari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary原创 2017-04-25 21:15:02 · 513 阅读 · 0 评论 -
CS Academy Round #30 (Div. 2 only) C.Constant Sum(树状数组,区间修改,单点查询模板)
Constant SumTime limit: 1000 msMemory limit: 128 MBYou have an array AA of NN integers. You have to perform QQ operations of two types:Update: given two integers ii and ss, a原创 2017-05-25 20:28:04 · 250 阅读 · 0 评论 -
Codeforces Round #410 (Div. 2) B. Mike and strings(字符串匹配)
B. Mike and stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has n strings s1, s2, ..., sn each原创 2017-04-23 10:29:46 · 658 阅读 · 0 评论 -
AtCoder Beginner Contest 059 C - Sequence(贪心)
C - SequenceTime limit : 2sec / Memory limit : 256MBScore : 300 pointsProblem StatementYou are given an integer sequence of length N. The i-th term in the sequence is ai. In one原创 2017-04-22 23:47:25 · 644 阅读 · 0 评论 -
POJ3616Milking Time(DP)
Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9610 Accepted: 3992DescriptionBessie is such a hard-working cow. In fact, she is so focused原创 2017-05-23 22:43:18 · 233 阅读 · 0 评论 -
POJ-2823Sliding Window(单调队列模板)
Sliding WindowTime Limit: 12000MS Memory Limit: 65536KTotal Submissions: 58321 Accepted: 16711Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 i原创 2017-03-01 23:57:23 · 237 阅读 · 0 评论 -
E. Anton and Tree(缩点+树直径模板)
E. Anton and Treetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is growing a tree in his garden. In原创 2017-03-01 23:58:59 · 498 阅读 · 0 评论 -
POJ1985Cow Marathon(求树的直径模板)
Cow MarathonTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 5253 Accepted: 2574Case Time Limit: 1000MSDescriptionAfter heari原创 2017-03-02 23:49:05 · 227 阅读 · 0 评论 -
POJ3661running
RunningTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6818 Accepted: 2532DescriptionThe cows are trying to become better athletes, so Bessie is running原创 2017-03-24 10:10:13 · 298 阅读 · 0 评论 -
POJ3660Cow Contest(floyed算法模板)
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11015 Accepted: 6128DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are particip原创 2017-03-27 21:56:56 · 349 阅读 · 0 评论 -
D. Remainders Game(最小公倍数,最大公约数模板)
B. Remainders Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday Pari and Arya are playing a game ca转载 2017-03-18 23:30:19 · 381 阅读 · 0 评论 -
B. Chamber of Secrets
B. Chamber of Secretstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output"The Chamber of Secrets has been open原创 2017-03-08 23:53:45 · 607 阅读 · 0 评论 -
C. Dima and Salad
C. Dima and Saladtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima, Inna and Seryozha have gathered in a原创 2017-03-08 23:29:13 · 250 阅读 · 0 评论 -
HDU2087剪花布条
剪花布条Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19173 Accepted Submission(s): 12054Problem Description一块花布条,里面有些图案,另有一块直接可用的小原创 2017-03-17 22:52:49 · 163 阅读 · 0 评论