<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[overload1997]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/overload1997</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; overload1997]]></copyright><item><title><![CDATA[淘宝登陆界面]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/120630413</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/120630413</guid><author>overload1997</author><pubDate>Wed, 06 Oct 2021 22:02:55 +0800</pubDate><description><![CDATA[&lt;!DOCTYPE html&gt;
&lt;html&gt;
    &lt;head&gt;
        &lt;style&gt;
            *{
                margin: 0;
                padding: 0;
            }

            .div{
                width: 100%;
                height: 800px;                
   ]]></description><category></category></item><item><title><![CDATA[广州大学招聘会总结（IT岗位）]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/88376602</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/88376602</guid><author>overload1997</author><pubDate>Sat, 30 Mar 2019 18:10:16 +0800</pubDate><description><![CDATA[今天无意中与朋友去了一波广州大学商业中心的招聘会，体验了一下招聘的气氛
面了几家互联网的公司吧，题目总结如下 :

TCP与UDP的协议的区别

举具体例子，什么时候用TCP协议什么时候用UDP协议


C++数组跟指针创建数组（动态数组）的区别
二叉树可以用来干什么
列举使用过的容器

map内部是用什么数据结构实现的
请讲解一下你对红黑树的理解


define与const的区别
面向对象有哪...]]></description><category></category></item><item><title><![CDATA[C++ 标准库中的numberic_limits]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/81604380</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/81604380</guid><author>overload1997</author><pubDate>Sun, 12 Aug 2018 10:58:49 +0800</pubDate><description><![CDATA[先来看一组example: 


#include &amp;lt;iostream&amp;gt;     // std::cout
#include &amp;lt;limits&amp;gt;       // std::numeric_limits
int main () {
  std::cout &amp;lt;&amp;lt; std::boolalpha;
  std::cout &amp;lt;&amp;lt; &quot;Minimum value ...]]></description><category></category></item><item><title><![CDATA[C++面试题汇总]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/80341585</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/80341585</guid><author>overload1997</author><pubDate>Tue, 29 May 2018 10:44:14 +0800</pubDate><description><![CDATA[一、求一个无序数组中的第k大元素

（一）分治

（二）最小堆

（三）桶排序

二、关于排序的稳定性

概念：排序的稳定性是指如果在排序的序列中，存在前后相同的两个元素的话，排序前 和排序后他们的相对位置不发生变化

分类：堆排序、快速排序、希尔排序、直接选择排序不是稳定的排序算法，而基数排序、冒泡排序、直接插入排序、折半插入排序、归并排序是稳定的排序算法。

三、TCP和UDP的区别和应用场景...]]></description><category></category></item><item><title><![CDATA[UVA11426 FZU1969 51NOD1188 线性欧拉筛法+筛法]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78420482</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78420482</guid><author>overload1997</author><pubDate>Thu, 02 Nov 2017 02:00:28 +0800</pubDate><description><![CDATA[题目大意：计算：G=∑i<Ni=1∑j<=Nj=i+1GCD(i,j)G=\sum_{i=1}^{i<N}\sum_{j=i+1}^{j<=N}{GCD(i,j)}难度系数(往下递增):UVA11426FZU196951NOD1188题目思路一：G=∑ng=1g(∑phi(⌊gd⌋−1) G=\sum_{g=1}^{n}{g(\sum{phi(\lfloor{\frac{g}{d}}\rfloor-]]></description><category></category></item><item><title><![CDATA[hdu5618Jam's problem again (CDQ分治)]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78210543</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78210543</guid><author>overload1997</author><pubDate>Thu, 12 Oct 2017 08:59:39 +0800</pubDate><description><![CDATA[Jam's problem again
Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1417    Accepted Submission(s): 504



Problem Description

Jam lik]]></description><category></category></item><item><title><![CDATA[Codeforces Beta Round #86 (Div. 2 Only) E   Double Happiness  素数筛法，费马平方和定理]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78176784</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78176784</guid><author>overload1997</author><pubDate>Sun, 08 Oct 2017 19:40:13 +0800</pubDate><description><![CDATA[题目链接







E. Double Happiness


time limit per test
3 seconds


memory limit per test
128 megabytes


input
standard input


output
standard output



On the math lesson]]></description><category></category></item><item><title><![CDATA[Codeforces Round #439 (Div. 2) C. The Intriguing Obsession dp]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78174749</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78174749</guid><author>overload1997</author><pubDate>Sun, 08 Oct 2017 14:19:02 +0800</pubDate><description><![CDATA[C. The Intriguing Obsession


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



— This is not playing but duty a]]></description><category></category></item><item><title><![CDATA[Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)C - Qualification]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78162872</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78162872</guid><author>overload1997</author><pubDate>Thu, 05 Oct 2017 21:13:37 +0800</pubDate><description><![CDATA[C. Qualification Rounds


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Snark and Philip are preparing the ]]></description><category></category></item><item><title><![CDATA[51nod1228 序列求和 （伯努利数）]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78161580</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78161580</guid><author>overload1997</author><pubDate>Thu, 05 Oct 2017 15:48:47 +0800</pubDate><description><![CDATA[1228 序列求和

题目来源： HackerRank

基准时间限制：3 秒 空间限制：131072 KB 分值: 160 难度：6级算法题




 收藏


 关注




T(n) = n^k，S(n) = T(1) + T(2) + ...... T(n)。给出n和k，求S(n)。

例如k = 2，n = 5，S(n) = 1^2 + 2^2 +]]></description><category></category></item><item><title><![CDATA[hdu4777 Rabbit Kingdom （离线处理、互斥）]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78119277</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78119277</guid><author>overload1997</author><pubDate>Thu, 28 Sep 2017 08:49:23 +0800</pubDate><description><![CDATA[Online Judge
Online Exercise
Online Teaching
Online Contests
Exercise Author


F.A.Q
Hand In Hand
Online Acmers

Forum | Discuss
Statistical Charts

Problem Archive
Realtime Judge Statu]]></description><category></category></item><item><title><![CDATA[2017 ACM-ICPC 亚洲区（西安赛区）网络赛 G Xor lca+暴力]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/78007196</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/78007196</guid><author>overload1997</author><pubDate>Sat, 16 Sep 2017 22:28:41 +0800</pubDate><description><![CDATA[题目链接：https://nanti.jisuanke.com/t/17120
题意：给你一棵树，每个点都有权值，q次询问，每次询问给你a,b,k，问从点a到点b每隔k步的异或和是多少。
思路：现场没敢打，复杂度怎么算都不对。。。后来别人说可以1的情况lca其他暴力，我就试了一下，一开始是TLE，然后我各种迷之优化确实可以过。。。。走k步这里我是用了倍增的数组然后用logk的复杂度走k步。。。]]></description><category></category></item><item><title><![CDATA[hdu 6194 string string string 后缀数组+rmq+容斥]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77994991</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77994991</guid><author>overload1997</author><pubDate>Fri, 15 Sep 2017 19:31:36 +0800</pubDate><description><![CDATA[string string string
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1531    Accepted Submission(s): 440



Problem Description

Uncle ]]></description><category></category></item><item><title><![CDATA[后缀数组模板]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77992650</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77992650</guid><author>overload1997</author><pubDate>Fri, 15 Sep 2017 15:56:04 +0800</pubDate><description><![CDATA[来源：http://blog.youkuaiyun.com/yxuanwkeith/article/details/50636898。
详情看上面，下面只写上我需要的部分。
Str ：需要处理的字符串(长度为Len) 
Suffix[i] ：Str下标为i ~ Len的连续子串(即后缀) 
Rank[i] : Suffix[i]在所有后缀中的排名 
SA[i] : 满足Suffix[SA[1]]]]></description><category></category></item><item><title><![CDATA[2017 icpc广西邀请赛 K.Query on A Tree (hdu 6191)可持久化字典树]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77744673</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77744673</guid><author>overload1997</author><pubDate>Thu, 31 Aug 2017 12:17:41 +0800</pubDate><description><![CDATA[Query on A Tree
Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0



Problem Description

Monkey A liv]]></description><category></category></item><item><title><![CDATA[高斯消元模板]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77543647</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77543647</guid><author>overload1997</author><pubDate>Fri, 25 Aug 2017 00:05:53 +0800</pubDate><description><![CDATA[#include
using namespace std;
#define eps 1e-9
const int MAXN=220;
const int N=3;
double a[MAXN][MAXN],x[MAXN];//方程的左边的矩阵和等式右边的值，求解之后x存的就是结果
int equ,var;//方程数和未知数个数
/*
*返回0表示无解，1表示有解
*/
int Gauss()//高]]></description><category></category></item><item><title><![CDATA[hdu 6171 Admiral 双向bfs+hash]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77542452</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77542452</guid><author>overload1997</author><pubDate>Thu, 24 Aug 2017 21:48:54 +0800</pubDate><description><![CDATA[Admiral
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 153428/153428 K (Java/Others)
Total Submission(s): 206    Accepted Submission(s): 54



Problem Description

Suppose that you ar]]></description><category></category></item><item><title><![CDATA[hdu 6166 Senior Pan 最短路]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77485646</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77485646</guid><author>overload1997</author><pubDate>Tue, 22 Aug 2017 20:32:50 +0800</pubDate><description><![CDATA[Senior Pan
Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 179    Accepted Submission(s): 45



Problem Description

Senior Pan fail]]></description><category></category></item><item><title><![CDATA[hdu 6148 Valley Numer 数位dp]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77371884</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77371884</guid><author>overload1997</author><pubDate>Fri, 18 Aug 2017 16:39:55 +0800</pubDate><description><![CDATA[Valley Numer
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0



Problem Description

众所周知，度度熊非常喜欢数字。]]></description><category></category></item><item><title><![CDATA[hdu 6118  度度熊的交易计划 费用流]]></title><link>https://blog.youkuaiyun.com/overload1997/article/details/77159842</link><guid>https://blog.youkuaiyun.com/overload1997/article/details/77159842</guid><author>overload1997</author><pubDate>Mon, 14 Aug 2017 11:38:20 +0800</pubDate><description><![CDATA[度度熊的交易计划
Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 647    Accepted Submission(s): 226



Problem Description

度度熊参与了喵哈哈村的商业大会，但是]]></description><category></category></item></channel></rss>