hwy499的博客

题意：有一个钩子由n个小棒构成，每个小棒有三种类型，长度分别为：1，2，3；一共有m次操作，m次操作后询问问钩子的长度，注意：钩子的初始长度为n，即每个叶子节点的值为1AC代码：//裸模板题#include <iostream>#include <stdio.h>#define ll long long#define lson l, mid, rt <...

class Solution {public: /** * @param expression: a list of strings * @return: an integer */ inline bool isNum(char num) { return (num>='0'&&num<='9')?true:fa...

class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { int[] arr = new int[nums1.length + nums2.length]; int i = 0; int j = 0; int k = 0;...

Eclipse 之快捷键Alt + / 快速生成main 方法Ctrl+Shift+/ ： 添加/* */注释Ctrl+Shift+\ ： 消除/* */注释ctrl + shfit + c 或者 Ctrl+/： 添加//注释等待更新...

#include &lt;iostream&gt;#include &lt;stdio.h&gt;#include &lt;queue&gt;#include&lt;cstring&gt;#include&lt;cmath&gt;#define MAX_N 105#define MAX_M 105using namespace std;typedef pair&lt;int,int...

标题树状数组模板 (单点更新区间求和）#include&amp;amp;amp;amp;amp;lt;iostream&amp;amp;amp;amp;amp;gt;#include&amp;amp;amp;amp;amp;lt;cstring&amp;amp;amp;amp;amp;gt;#include&amp;amp;amp;amp;amp;lt;cmath&amp;amp;amp;amp;amp;gt;using namespace

字典树#include&amp;amp;amp;amp;amp;amp;lt;iostream&amp;amp;amp;amp;amp;amp;gt;#include&amp;amp;amp;amp;amp;amp;lt;cstdio&amp;amp;amp;amp;amp;amp;gt;#include&amp;amp;amp;amp;amp;amp;lt;cstring&amp;amp;amp;amp;amp;amp;gt;using na

线段树模板#include &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;lt;iostream&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;gt;#include &amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;lt;stdio.h&amp;amp;amp;amp;amp;amp;amp;a

I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 105843 Accepted Submission(s): 39732Problem Description：很多学校流行一种比较的习惯。老师们很喜欢询问，从...

dijkstra 最短路算法模板（以HDU - 2544 为例）#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int MAXN = 105;const int INF = 0x3f3f3f3f;int map[MAXN][MAXN];int...