2017年08月_AC_Lee

原创 hdu 3715 2-sat + 二分

题目：Go DeeperTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3171 Accepted Submission(s): 1032Problem DescriptionHere is

2017-08-20 20:43:50 324

原创 poj kmp入门几题 mark

poj 3461:找模式串在匹配串中出现的次数#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define pi acos

2017-08-18 22:56:52 460

原创 zoj 3005 矩形覆盖 + 搜索

题目：Bacteria ColonyTime Limit: 2 Seconds Memory Limit: 65536 KBThe biologist Mr.R likes cultivating bacteria on the culture medium. What is interesting is that the new cultivated

2017-08-16 12:42:37 218

原创 hdu 6119 百度之星初赛B 小小粉丝度度熊

题目：小小粉丝度度熊Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1326 Accepted Submission(s): 428Problem Description度度熊喜欢着喵哈哈村

2017-08-14 22:10:36 246

原创 hdu 5256 LIS变形

题目：序列变换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2129 Accepted Submission(s): 722Problem Description我们有一个数列A1,A2.

2017-08-14 21:04:53 218

原创求区间中1的个数最多的数若有多个输出最小的

原题链接：http://acm.ecnu.edu.cn/problem/3303/分析：数据量大考虑按位处理每次把 L 中的二进制其中一个0变成1，直到比R大有多个优先输出小的，也就是二进制中0在高位的，也就是优先将低位0变1 使用ans|=ans+1;将最低位0变1代码：#includeusing namespace std;#define ll u

2017-08-04 20:56:38 615

原创 C++输入输出格式--保留n位小数

打印：#include#includeusing namespace std;double p=0.123456789;int main(){ cout<<setiosflags(ios::fixed)<<setprecision(6)<<p<<endl;///0.123457 return 0;}更多输入输出控制参：http://images2015.cnblogs.c

2017-08-02 21:34:33 1198

原创 poj 2831次小生成树变形

题目：Can We Build This One?Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1671 Accepted: 630Case Time Limit: 2000MSDescription“Highways are

2017-08-02 19:36:49 206

原创 poj 1679 次小生成树

题目：代码：#include#include#include#includeusing namespace std;const int maxn = 1010;const int maxm = 100010;const int inf=0x7f7f7f7f;int n,m,t;struct edge{ int from,to,w; bo

2017-08-02 16:53:44 196

xiaoli_nu的博客