<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[新月]]></title><description><![CDATA[红色春天的开始]]></description><link>https://blog.youkuaiyun.com/Kirito_Acmer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Kirito_Acmer]]></copyright><item><title><![CDATA[《Same Representation,Different Attentions:Shareable Sentence Representation》阅读笔记]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/85261713</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/85261713</guid><author>Kirito_Acmer</author><pubDate>Wed, 26 Dec 2018 14:36:37 +0800</pubDate><description><![CDATA[之后会不定期分享论文笔记。

摘要

不同的任务句子表示不同，而且句子表示受限于不多的训练数据。论文提出一个橘子表示的模型可以用于多种任务。所有任务分享相同的句子表示，每个任务可以从共享的句子表示中利用attention机制抽取任务特定的信息。每个任务注意力机制的问题向量可以是静态的参数也可以是动态的。论文在16个不同的文本分类任务中做实验，并取得了很好的效果。

背景

词向量在多个任务中已经有...]]></description><category></category></item><item><title><![CDATA[退役了]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/70739653</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/70739653</guid><author>Kirito_Acmer</author><pubDate>Tue, 11 Dec 2018 12:33:52 +0800</pubDate><description><![CDATA[快半年没写博客了，省赛打完退役了。回顾这两年多的ACM，感觉收获挺多，比刚入大学的我强了不少，但是还是很菜。现在想来还是怀念坐在机房听着缘之空插曲敲着代码的日子，早早地来到机房补bc或者cf的题，学习各种算法，感觉自己学会了各种忍术（笑）。做题目的日子很纯粹，没有烦心事，红色的ACCEPTED带来的感动至今难忘，那种感觉真的挺好。和很多大神组过队，打省赛感觉自己更多的是在一旁翻译题目，插不上手（摊...]]></description><category></category></item><item><title><![CDATA[hdu4126Genghis Khan the Conqueror (最小生成树+树形dp)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52624917</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52624917</guid><author>Kirito_Acmer</author><pubDate>Thu, 22 Sep 2016 17:17:50 +0800</pubDate><description><![CDATA[Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 327680/327680 K (Java/Others)
Total Submission(s): 2524    Accepted Submission(s): 760



Problem Description

Genghis Khan(成吉思汗)(1162-1]]></description><category></category></item><item><title><![CDATA[hdu5886Tower Defence（树形dp）]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52596073</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52596073</guid><author>Kirito_Acmer</author><pubDate>Tue, 20 Sep 2016 15:10:20 +0800</pubDate><description><![CDATA[Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 242    Accepted Submission(s): 80



Problem Description

There was a civil war between ]]></description><category></category></item><item><title><![CDATA[hdu5893 List wants to travel(树链剖分+线段树)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52585627</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52585627</guid><author>Kirito_Acmer</author><pubDate>Mon, 19 Sep 2016 14:40:32 +0800</pubDate><description><![CDATA[Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 270    Accepted Submission(s): 47



Problem Description

A boy named List who is perf]]></description><category></category></item><item><title><![CDATA[hdu5884 Sort(二分)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52565138</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52565138</guid><author>Kirito_Acmer</author><pubDate>Sat, 17 Sep 2016 20:38:07 +0800</pubDate><description><![CDATA[Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 547    Accepted Submission(s): 101



Problem Description

Recently, Bob has just learnt]]></description><category></category></item><item><title><![CDATA[hdu3559 Frost Chain (概率dp+记忆化搜索)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52268098</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52268098</guid><author>Kirito_Acmer</author><pubDate>Sun, 21 Aug 2016 16:56:45 +0800</pubDate><description><![CDATA[Problem Description

In the unimaginable popular DotA game, the hero Lich has a wonderful skill: Frost Chain, release a jumping breath of frost that jumps N times against enemy units.




Today]]></description><category></category></item><item><title><![CDATA[hdu5790 Prefix(Trie树+主席树)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52106539</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/52106539</guid><author>Kirito_Acmer</author><pubDate>Wed, 03 Aug 2016 19:18:18 +0800</pubDate><description><![CDATA[Problem Description

Alice gets N strings. Now she has Q questions to ask you. For each question, she wanna know how many different prefix strings between Lth and Rth strings. It's so easy right? So]]></description><category></category></item><item><title><![CDATA[hdu5726 GCD(gcd +二分+rmq)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51959306</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51959306</guid><author>Kirito_Acmer</author><pubDate>Tue, 19 Jul 2016 20:40:59 +0800</pubDate><description><![CDATA[Problem Description

Give you a sequence of N(N≤100,000) integers
 : a1,...,an(0ai≤1000,000,000).
 There are Q(Q≤100,000) queries.
 For each query l,r you
 have to calculate gcd(al,,al+1,...,ar)]]></description><category></category></item><item><title><![CDATA[UVA 10480 Sabotage (最大流最小割)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51954564</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51954564</guid><author>Kirito_Acmer</author><pubDate>Tue, 19 Jul 2016 11:54:06 +0800</pubDate><description><![CDATA[题目链接：点击打开链接
题意：把一个图分成两部分，要把点1和点2分开。隔断每条边都有一个花费，求最小花费的情况下，应该切断那些边。
这题很明显是最小割，也就是最大流。把1当成源点，2当成汇点。
问题是要求最小割应该隔断那条边。
思路：求最小割就是求最大流，求完后，剩余网络中，能由起点到达的是和起点一个集合的，其他的都是和终点一个集合的。
#include
#include
#includ]]></description><category></category></item><item><title><![CDATA[bzoj2002 [Hnoi2010]Bounce 弹飞绵羊 (分块)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51945549</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51945549</guid><author>Kirito_Acmer</author><pubDate>Mon, 18 Jul 2016 21:05:38 +0800</pubDate><description><![CDATA[Time Limit: 10 Sec  Memory Limit: 259 MB
Submit: 7896  Solved: 4124
[Submit][Status][Discuss]
Description

某天，Lostmonkey发明了一种超级弹力装置，为了在他的绵羊朋友面前显摆，他邀请小绵羊一起玩个游戏。游戏一开始，Lostmonkey在地上沿着一条直线摆上n个装置，每个装置]]></description><category></category></item><item><title><![CDATA[poj3580 SuperMemo (Splay+区间内向一个方向移动)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51457470</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51457470</guid><author>Kirito_Acmer</author><pubDate>Thu, 19 May 2016 22:02:15 +0800</pubDate><description><![CDATA[Time Limit: 5000MS
 
Memory Limit: 65536K


Total Submissions: 13550
 
Accepted: 4248


Case Time Limit: 2000MS




Description

Your friend, Jackson is invited to a TV show called Su]]></description><category></category></item><item><title><![CDATA[bzoj1500: [NOI2005]维修数列 (Splay+变态题)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51444990</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51444990</guid><author>Kirito_Acmer</author><pubDate>Wed, 18 May 2016 16:29:01 +0800</pubDate><description><![CDATA[Time Limit: 10 Sec  Memory Limit: 64 MB
Submit: 11353  Solved: 3553
[Submit][Status][Discuss]
Description



Input

输入的第1 行包含两个数N 和M(M ≤20 000)，N 表示初始时数列中数的个数，M表示要进行的操作数目。
第2行包含N个数字，描述初始时的数列]]></description><category></category></item><item><title><![CDATA[hdu3436 Queue-jumpers(Splay)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51435826</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51435826</guid><author>Kirito_Acmer</author><pubDate>Tue, 17 May 2016 14:35:10 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3411    Accepted Submission(s): 923



Problem Description

Ponyo and Garfield are waiti]]></description><category></category></item><item><title><![CDATA[hdu4710 Balls Rearrangement(数学公式+取模)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51418326</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51418326</guid><author>Kirito_Acmer</author><pubDate>Sun, 15 May 2016 19:24:30 +0800</pubDate><description><![CDATA[Balls Rearrangement
Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 945    Accepted Submission(s): 380



Problem Description

Bob has ]]></description><category></category></item><item><title><![CDATA[hdu1890 Robotic Sort (splay+区间翻转单点更新)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51393968</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51393968</guid><author>Kirito_Acmer</author><pubDate>Fri, 13 May 2016 11:39:28 +0800</pubDate><description><![CDATA[Problem Description

Somewhere deep in the Czech Technical University buildings, there are laboratories for examining mechanical and electrical properties of various materials. In one of yesterday’s]]></description><category></category></item><item><title><![CDATA[zoj2112 Dynamic Rankings （主席树 || 树套树）]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51326140</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51326140</guid><author>Kirito_Acmer</author><pubDate>Thu, 05 May 2016 20:52:36 +0800</pubDate><description><![CDATA[The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest number of the given N numbers. They
 have developed ]]></description><category></category></item><item><title><![CDATA[poj3581 Sequence (后缀数组)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51298003</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51298003</guid><author>Kirito_Acmer</author><pubDate>Mon, 02 May 2016 20:46:07 +0800</pubDate><description><![CDATA[Time Limit: 5000MS
 
Memory Limit: 65536K


Total Submissions: 6305
 
Accepted: 1364


Case Time Limit: 2000MS




Description

Given a sequence, {A1, A2, ..., An} which is guaranteed]]></description><category></category></item><item><title><![CDATA[UVA 11475 Extend to Palindrome (kmp || manacher || 后缀数组)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51290650</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51290650</guid><author>Kirito_Acmer</author><pubDate>Sun, 01 May 2016 15:53:06 +0800</pubDate><description><![CDATA[题目链接：点击打开链接
题意：给你一个串，让你在串后面添加尽可能少的字符使得这个串变成回文串。
思路：这题可以kmp,manacher,后缀数组三种方法都可以做，kmp和manacher效率较高，时间复杂度是O(n)，后缀数组时间复杂度是O(nlogn).思路是求出元串的后缀和反串的前缀匹配的最大长度。用后缀数组的时候求出l=lcp(i,len+1)，判断l+i是不是等于len,如果等于那么就]]></description><category></category></item><item><title><![CDATA[poj3415 Common Substrings (后缀数组+单调队列)]]></title><link>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51286990</link><guid>https://blog.youkuaiyun.com/Kirito_Acmer/article/details/51286990</guid><author>Kirito_Acmer</author><pubDate>Sat, 30 Apr 2016 17:02:37 +0800</pubDate><description><![CDATA[Time Limit: 5000MS
 
Memory Limit: 65536K


Total Submissions: 9414
 
Accepted: 3123




Description

A substring of a string T is defined as:

T(i, k)=TiTi+1...Ti+k-1, 1≤i≤i+k-1≤|T|.]]></description><category></category></item></channel></rss>