原创 spoj-687(後綴數組+RMQ)

spoj-687(後綴數組+RMQ) 題目: A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed

原创 codeforces 776C

codeforces 776C 題目: C. Molly’s Chemicals time limit per test2.5 seconds memory limit per test512 megabytes inputs

原创 poj-3693(後綴數組+RMQ)

poj-3693 Maximum repetitiion substring 題目: The repetition number of a string is defined as the maximum number R such

原创 poj-2774(後綴數組)

poj-2774 Long Long Message 題目: The little cat is majoring in physics in the capital of Byterland. A piece of sad new

原创 Codeforces776B

Codeforces776B 題目: B. Sherlock and his girlfriend time limit per test1 second memory limit per test256 megabytes

原创 Codeforces 782B. The Meeting Place Cannot Be Changed(二分)

Codeforces 782B. The Meeting Place Cannot Be Changed(二分) 題目: The main road in Bytecity is a straight line from south t

原创 Codeforces 778A(二分答案)

Codeforces 778A String Game 題目: String Game time limit per test2 seconds memory limit per test512 megabytes inputs

原创 codeforce 777B(水)

codeforce 777B Game of Credit Cards 題目: Game of Credit Cards time limit per test2 seconds memory limit per test256 m

原创 codeforces 781B. Innokenty and a Football League(貪心)

codeforces 781B. Innokenty and a Football League(貪心) 題目: Innokenty is a president of a new football league in Byteland

原创 HDU6096 String(Trie樹)

HDU6096 String Problem Description Bob has a dictionary with N words in it. Now there is a list of words in which the

原创 UVA-11475-Extend to Palindrome((擴展)kmp)

UVA-11475-Extend to Palindrome((擴展)kmp) 題目: Your task is, given an integer N, to make a palidrome (word that reads the

原创 POJ-2758 checking the text(哈希+二分)

POJ-2758 checking the text(哈希+二分) 題目: Wind’s birthday is approaching. In order to buy a really really fantastic gift f

原创 Codeforces 777D

Codeforces 777D Cloud of Hashtags 題目: Cloud of Hashtags time limit per test2 seconds memory limit per test256 megaby

原创 UWP_Homework_2

UWP_Homework_2 目標App—–Tencent QQ 1. 當要轉發一條消息時可以選擇聯繫人進行轉發,這可以用到Select contacts功能 https://docs.microsoft.com/en-us/win

原创 文章標題

A. Andryusha and Colored Balloons time limit per test2 seconds memory limit per test256 megabytes inputstandard inpu