hdu 4746Mophues[莫比乌斯反演]

Mophues Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 327670/327670 K (Java/Others)Total Submission(s): 1669 &nb
2次阅读

Dumb Bones UVA - 10529[多米诺重构]

Dumb Bones UVA - 10529  来自绿书p176 题意你试图把一些多米诺骨牌排成直线,然后推倒它们。但是如果你在放骨牌的时候不小心把刚放的骨牌碰倒了,它就会把相临的一串骨牌全都碰倒,而你的工作也被部分的破坏了。比如你已经把骨牌摆成了DD__Dx
2次阅读

跟我一起学Git (十) Patches【转】

本文转载自:http://cs-cjl.com/2014/05/05/learn_git_with_me_10Git实现了以下三条用于交换patch的命令:git format-patch 用于创建一个email格式的patchgit send-email 通过SMTP发送一个Git patchgi
2次阅读

[Node.js] Take Screenshots of Multiple Dimensions for Responsive Sites using Nightmare

When developing responsive websites, you will constantly be resizing your browser to make sure your site is properly responding to all of the resizes.
2次阅读

hdu 5318 The Goddess Of The Moon

The Goddess Of The MoonTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 148
5次阅读

Android Warning not all local changes may be shown due to an error

idea使用svn出现Warning not all local changes may be shown due to an error,如下图所示:解决方案:1、File > Se
2次阅读

BZOJ3569 DZY Loves Chinese II

 题目链接:BZOJ3569正解:其他+线性基解题报告:  考虑先构出一棵原图的生成树,对于每条非树边$rand$一个权值,每条树边的权值设为覆盖(或者说跨越?)了这条边的边权异或和,  那么每次如果导致图不连通,当且仅当一条树边被删除且覆盖了这条树边的所有边都被删除了,这种情况下这些边的
3次阅读

LeetCode 121: Best Time to Buy and Sell Stock

题目如下:Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transac
7次阅读

ES数据

通过Elasticsearch使用的你的数据Elasticsearch 系列导航 elasticsearch 与 elasticsearch-head 的安装 ElasticSearch Index API && Mapping 在ElasticSear
6次阅读

[LeetCode] Longest Uncommon Subsequence II 最长非共同子序列之二

 Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longes
6次阅读