feng_zhiyu的博客

链接： https://vjudge.net/problem/UVA-12405题意：给定正整数n(n<=100)，接着输入长度为n的字符串，只由’.’和’#’组成，一个’#’可以覆盖相邻三个’.’，求最少用多少个’#’可以覆盖所有的’.’？分析：贪心，遇到一个’.’，ans++，跳过后面的两个字符#include<cstdio>#include<cstring>#include<algorit

链接： https://vjudge.net/problem/UVA-11039 题意：有n个绝对值各不相同的非0整数，选出尽量多的书，排成一个序列，使得正负号交替，且绝对值递增。输入n（1<=n<5e5）和n个整数，输出最长的序列长度。分析：贪心#include <cstdio>#include <cstring>#include <iostream>#include <cmath>#i

原题链接 题意：给两个长度为n的序列的坐标，分别为(Ai,Bi)，(Ci,Di)，求最多有多少对坐标满足Ai&amp;lt;Ci并且Bi&amp;lt;Di。分析：将满足题中条件的坐标对的下标(i,j)存入vector，然后就是匈牙利模板 复杂度：O(n*m) n RT，m为构成的坐标对的数量 模板解释：http://blog.youkuaiyun.com/dark_scope/article/details/...

http://codeforces.com/contest/950/problem/C 题意： 给长为n（&amp;lt;=2e5）由0，1组成的字符串，求分割成以0开头和结尾并且0，1交替出现的若干个字符串，要求它们的位置是递增的。分析： 贪心， 赛时各种特判，因为写的代码 太烂，然后就卡在第八组数据。 改不动了，改完后最坏情况下复杂度成了O(n^2)而大多数大佬 代码比较优美 使用v...

题目链接Given any permutation of the numbers {0, 1, 2,..., N-1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4...

题目链接With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Differ...

题目链接Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional mooncakes according to the region's culture....