ACM
sterotype girl
这个作者很懒,什么都没留下…
展开
-
POJ2531 Network Saboteur
https://blog.csdn.net/tzyshiwolaogongya/article/details/78565026A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefull...转载 2018-08-09 20:55:15 · 135 阅读 · 0 评论 -
洛谷 P1048 采药 01背包
dp数组一定要先进行初始化(不然会出错),数组放在int函数外面也可以全部初始化为0 未AC的#include<stdio.h>#include<iostream>#include<string>#define max(a,b) a>b?a:busing namespace std;int main(){ int t, m;...原创 2018-09-15 09:40:34 · 158 阅读 · 0 评论 -
HDU 1012 u Calculate e
1.没有AC的代码#include<stdio.h>double a[10];void init(){ a[0] = 1; for (int i = 1; i <= 9; i++) { int tmp = 1; for (int j = 1; j <= i; j++) tmp *=...原创 2018-09-07 15:02:37 · 84 阅读 · 0 评论 -
CUC-SummerTraining-30 2018 浙江省赛 Mergeable Stack
题目链接:https://vjudge.net/contest/252597#problem/C1.超内存了,如何处理#include&amp;lt;stdio.h&amp;gt;#include&amp;lt;string&amp;gt;#include&amp;lt;iostream&amp;gt;#include&amp;lt;stack&amp;gt原创 2018-09-07 12:17:32 · 188 阅读 · 0 评论 -
HDU 1005 关于斐波那契数列
A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).1.超内存了,第一反应:不应该用递归做,应该用迭代做#incl...原创 2018-09-06 17:56:28 · 209 阅读 · 0 评论 -
写一个sqrt函数的方法
题目链接:https://nanti.jisuanke.com/t/17 样例输入 1 2 3 4 5 6 7 8 9 样例输出 1 1 1 2 2 2 2 2 3 1.会超时!#include&lt;stdio.h&gt;#include&lt;iostream&gt;using namespace std;int sqr(int n){...原创 2018-09-04 22:22:03 · 2372 阅读 · 2 评论 -
Ice Cave的DFS和BFS用法
You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through ...转载 2018-08-08 21:26:14 · 153 阅读 · 0 评论 -
Red and Black
转载:https://blog.csdn.net/hurmishine/article/details/50927317There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From ...转载 2018-08-08 20:10:31 · 388 阅读 · 0 评论 -
CodeForces 792A New Bus Route之超时处理
题目来自: https://blog.csdn.net/eseszb/article/details/69525736 题目如下: There are n cities situated along the main road of Berland. Cities are represented by their coordinates — integer numbers a1, a...原创 2018-08-02 22:01:22 · 202 阅读 · 0 评论 -
n!的位数
求一个数阶乘的位数有公式#include&lt;stdio.h&gt;#include&lt;memory.h&gt;#define MAX 100000long long h[MAX];int main(){ long long n,num; scanf_s("%lld", &amp;n); while (n--) { lo转载 2018-08-06 20:59:35 · 464 阅读 · 0 评论 -
倍增和差分
两种降时间复杂度的方法离线查询(做起来容易):CDQ分治在线查询:树套树倍增RMQ区间最值查询Range Minimum/Maximum Query:给定一个数组,求出给定区间[l,r]最值的下标倍增最关键的地方是:绝对不会走都是相同的步数(比如说走两步可以到达的地方绝对不会分两个一步走)其次可以想到:成倍的增长->2(1,2,4,8,16…)ST(Sparse Tabl...原创 2019-04-25 00:10:36 · 298 阅读 · 1 评论