#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#include <queue>#include <stack>#include <set>#include...

Coding Problem如果没有三角形，那么数列是斐波拉契数列级别增长，所以个数<50；#include <iostream>#include <cmath>#include <cstdio>#include <algorithm>#include <cstring>#include <queue>#...

线段交#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#define INF 0x3f3f3f3fusing namespace std;const int maxn = 105;st...

题目：https://vjudge.net/problem/UVA-10391寻找组合单词直接利用set和string，将每个string拆成两部分，看能否在set中找到对应的部分#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#includ...

最长高地#include <iostream>#include <cstdlib>#include <cstdio>#include <cmath>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 10000002...

A:给定一个数，为01串，每次可以翻转一个位置上的数，问最少几步可以使得它模10x余10y从后往前贪心即可#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstring>#include<vector>#...

线段的重叠这个题目是贪心，怎么说呢，我觉得这个题目算是入门题，当遇到区间处理时，首先想到排序，排完序后就应该贪心处理，排序也是有方法的，就是l从小到大，r从大到小，这样也是为了更接近正确答案，最后分区间包含与不包含，区间覆盖两种情况处理即可#include<iostream>#include<string>#include<cstdio>#includ...