- 博客(7)
- 收藏
- 关注
RSS订阅原创 The Unique MST POJ - 1679 最小生成树和次小生成树
Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of ...
2020-03-31 13:23:00
90
原创 Food Delivery ZOJ3469 区间dp
When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery. Suppose there are N people living i...
2020-03-24 16:22:32
88
原创 [USACO16OPEN]262144 P 区间dp
题目描述 Bessie likes downloading games to play on her cell phone, even though she doesfind the small touch screen rather cumbersome to use with her large hooves. She is particularly intrigued by the curr...
2020-03-22 11:37:45
245
原创 HDU-1540 Tunnel Warfare 线段树最大连续区间
题目意思 n个点，m个操作(1<=n,m<=5e4)，m行中每行一个字符表示操作类型，一个整型数x表示第x个点 D x 表示去掉第x点，Q x表示需输出含 x 的最大连续区间的长度，R x表示还原最后去掉的点 解析： 看到区间查询和修改很明显是线段树 #include<iostream> #include<string> #include<stack&g...
2020-03-11 15:19:49
101
原创 POJ - 2376 Cleaning Shifts【贪心】
Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day i...
2020-02-19 19:15:41
151
原创 POJ - 2718 Smallest Difference（全排列）
题目: Given a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some order. The remaining digits can be written down in some ...
2020-02-19 10:40:02
121
原创 Educational Codeforces Round 82 (Rated for Div. 2) C. Perfect Keyboard
Polycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him — his keyboard will consist of only one row, where all 2626 lowercase Latin letters will be arranged...
2020-02-13 12:20:22
203
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人