- 博客(5)
- 资源 (2)
- 收藏
- 关注
原创 动态区间第k小 分块 O(nlogn*sqrt(nlogn))
代码:#include<iostream> #include<string.h> #include<stdio.h> #include<algorithm> #include<cmath> using namespace std; int n,q; struct node{ int x,y; }a[100005]; int b[100008]; int L[8005],R[8005]; in
2016-06-14 19:33:41 1177
原创 单调栈应用
题意大概让算t秒每一秒的最短路和,每条边每秒dis++;dp算距离dis[i][j]:1到i点走j条边的最短路O(n(n+ m)); 单调栈维护个上凸; 等差数列n^2求解; 代码:#include<iostream> #include<stdio.h> #include<string.h> #include<queue> #include<vector> using namespace st
2016-06-13 18:30:42 1033
原创 【poj 2976】 Dropping tests 二分(分数优化)
题目:http://poj.org/problem?id=2976Dropping testsTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 9121 Accepted: 3194 DescriptionIn a certain course, you take n tests. If you get ai out of
2016-06-01 18:42:37 3233 1
原创 【poj 3150】Cellular Automaton 矩阵
题目:http://poj.org/problem?id=3150Cellular Automaton 矩阵乘法+二分 Cellular AutomatonTime Limit: 12000MS Memory Limit: 65536K Total Submissions: 3544 Accepted: 1428 Case Time Limit: 2000MS DescriptionA
2016-06-01 18:33:05 3168
原创 【poj 3164】Command Network 最小树形图
题目:http://poj.org/problem?id=3164Command NetworkTime Limit: 1000MS Memory Limit: 131072K Total Submissions: 16037 Accepted: 4623 DescriptionAfter a long lasting war on words, a war on arms finally
2016-06-01 15:17:16 1223
c++ iostream 教程 PPT
2018-03-15
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人