GKHack's Blog

StringTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 813    Accepted Submission(s): 258Problem DescriptionThere is a string S.S

连连看Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25009    Accepted Submission(s): 6183Problem Description“连连看”相信很多人都玩过。没玩过也没

Zball in Tina TownTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 305    Accepted Submission(s): 186Problem DescriptionTina To

题目链接：点击打开链接给你字符串的长度以及这个字符串，问你前缀数量之和是多少。利用kmp中next数组的性质，将该跳多少位保存到nxt数组中，dp数组保存当前子串i所含前缀数量之和，dp[i] = (dp[nxt[i]] + 1) % MOD计算当前结尾子串i数量加上前nxt[i]个字符这一前缀的数量。AC代码：#include "iostream"#incl

题目链接：点击打开链接给你一个字符串，问你最少添加几个字符可以使字符串有循环节。利用nxt数组的性质，len - nxt[len]即为字符串的最小循环节，且如果len % (len - nxt[len]) == 0，那么当前字符串就是有循环节的，且最小循环节为len / (len - nxt[len])。AC代码：#include "iostream"#inc

题目链接：点击打开链接给你字符串长度以及此字符串，让你输出子字符串位置以及出现的次数。利用nxt数组以及i % (i - nxt[i]) == 0则有循环节的性质，扫一遍字符串，若满足条件就输出。AC代码：#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"usi

题目链接：给你两个字符串，问你第一个字符串的前缀和第二个字符串的后缀最长想等的字符是什么且长度为多少。把第二个字符串连接到第一个字符串后面，求长字符串的nxt数组，而后利用nxt数组的性质，如果nxt[len] > len1就继续比较，如果nxt[len] > len2也继续比较，最后nxt[x]即为所求字符串长度。AC代码：#include "iostream

题目链接:点击打开链接Manacher算法的模板题, Manacher算法用于求最长回文串的长度及其他拓展, 套板子即可, 最长为p[i] - 1.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MA

题目链接:点击打开链接给出一个序列, 让你输出子序列最大和以及子序列的起点和终点的值, 最大和为负则输出0以及序列的起点和终点的值.对每个读入的数累加, 比ans大则更新ans与起点终点, 若加到某处小于0则更新tmp与起点.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include

InputThere are multiply cases.For each case,there is a single integer n(1In second line,there are n integer a1,a2...an(0 OutputOutput ID of the man who should be punished.If

Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？  Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N

序列变换Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 854    Accepted Submission(s): 345Problem Description我们有一个数列A1,A2...An，你现在要求

Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿仍然很喜欢旅行，因为在旅途中 会遇见很多人（白马王子，^0^），很多事，还能丰富自己的阅历，还可以看美丽的风景……草儿想去很多地方，她想要去东京铁塔看夜景，去威尼斯看电影，去阳明山上看海芋，去纽约纯粹看雪景，去巴黎喝咖啡写信，去北京探望孟姜女……眼看寒假就快到了，这么一大

Phone ListTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14553    Accepted Submission(s): 4906Problem DescriptionGiven a list o

Input第一行一个整数T，表示有T组数据。每组数据第一行一个正整数N（N接下来每行有一条命令，命令有4种形式：(1) Add i j,i和j为正整数,表示第i个营地增加j个人（j不超过30）(2)Sub i j ,i和j为正整数,表示第i个营地减少j个人（j不超过30）;(3)Query i j ,i和j为正整数,i(4)End 表示结束，这条命令在每组数据最后出

Problem Description"Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but also can be built on money. So Chinese often s

InputThe first line contains one integer T≤5, which represents the number of testcases. For each testcase, there are two lines:1. The first line contains two integers n and a (1≤n≤20,1≤a

Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the sa

Problem DescriptionThe inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj.For a given sequence of numbers a1, a2, ..., an, if we mov

题目链接:点击打开链接给出两个字符串, 问你最长公共子序列有多长.lcs模板题目, 摘出求解过程:第一步：先计算最长公共子序列的长度。第二步：根据长度，然后通过回溯求出最长公共子序列。设一个C[i,j]: 保存Xi与Yj的LCS的长度。递推方程为：AC代码:#include "iostream"#includ

题目链接:点击打开链接给出两段字符串数组, 每段以"#"结尾,  要求输出两段字符串数组最长的公共字符串.lcs题目, 增加了一个flag数组保存字符串比较结果, 用于最后递归数据答案.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using na

Clarke and digitsTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 88    Accepted Submission(s): 44Problem DescriptionClarke is a

ArrayTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 490    Accepted Submission(s): 235Problem DescriptionVicky is a magician

NumbersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 449    Accepted Submission(s): 280Problem DescriptionThere is a number N.

SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 671    Accepted Submission(s): 355Problem DescriptionThere is a number sequen

Baby Ming and phone numberTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 373    Accepted Submission(s): 108Problem DescriptionB

ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 638    Accepted Submission(s): 302Problem DescriptionZYB has

How many integers can you findTime Limit: 12000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6048    Accepted Submission(s): 1735Problem Descripti

pog loves szh IITime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2346    Accepted Submission(s): 677Problem DescriptionPog and Sz

Clarke and five-pointed starTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 468    Accepted Submission(s): 247Problem Description

Clarke and foodTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 501    Accepted Submission(s): 292Problem DescriptionClarke is a

题目连接: 点击打开链接A: 模拟题, 从小到大排序后求a的前m个和与b的后m个和作比较即可.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 505;int n, m, a[MAXN]

题目链接:点击打开链接A: 读入数据的时候先把非0的乘到一起, 然后对n分类讨论, n为1直接输出a[0], 0的个数为n输出0. 而后对ans分类讨论, 大于0直接输出, 小于0的时候, 若0的个数为n - 1输出0, 其他情况则找到绝对值最小的负数除掉就为答案.AC代码:#include "iostream"#include "cstdio"#include "cs

题目链接:点击打开链接给你一个字符串, 让你输出这个字符串最长回文的起点和终点以及此回文串.Manacher算法的应用, 记录最长回文时i的指, 通过i以及p[i]求出起点和终点, 比较棘手的是输出, 搞了大半天发现一句话就可以解决..AC代码:#include "iostream"#include "cstdio"#include "cstring"#inclu

ballsTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 90    Accepted Submission(s): 59Problem DescriptionThere are n balls with

sequence1Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 132    Accepted Submission(s): 103Problem DescriptionGiven an array a w

sequence2Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 231    Accepted Submission(s): 95Problem DescriptionGiven an integer ar

matrixTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 304    Accepted Submission(s): 187Problem DescriptionGiven a matrix with n

题目链接: 点击打开链接A: 直接无脑暴力枚举三个数, 或者枚举前两个数, 第三个数二分, 我用了stl的lower_bound()AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 105

Problem DescriptionIt has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment