acm

CF 338E Optimize! - 线段树维护

1 minute read

Published: August 18, 2013

题意: 给一个串a,长度为n，一个串b长度为len, 问a有多少个长度为len的子串满足：和b任意匹配后，每一对值的和都大于等于h。

两题类似的数位DP

1 minute read

Published: August 17, 2013

CF 331C3 - The Great Julya Calendar (60 points) SGU 390 TICKETS

Suffix Automaton Tutorial

3 minute read

Published: August 06, 2013

This is a comprehensive tutorial on Suffix Automaton (SAM) with detailed problem solutions.

HDU 4622 Reincarnation - 三种解法对比

1 minute read

Published: July 31, 2013

题意: 长度为2000的串，10000个询问：[l,r]这个子串包含多少不同的子串。

A Contest to Celebrate Girlfriend’s Birthday by Staginner

less than 1 minute read

Published: July 16, 2013

Problem 1: Cut the rope II