逝者如斯夫，不舍昼夜

#include <iostream> #include <cstring> #include <cstdio> #include <queue> #include <algorithm> #include <cmath> #include <vector> #include <map> using namespace std; #define inf 0x7fffffff #define ll long l..

下面引入一个编程题理解最大连续子序列和的概念 有一个数组，如1， －5， 8， 3， －4， 15， －8，查找其中连续和最大的相邻串的值。在本例中，最大值为8 ＋ 3 ＋ －4 ＋ 15 ＝ 22. 朴素算法的复杂度为O(n^2)，另一种算法如下： 首先假设我们已经找到了最大连续和子串在数组中的起始位置（i）和结束位置（j），其中i <= j，即最大和maxSum = a[i] + a...

** 2018 宁夏邀请赛 F Moving On（floyd算法变形） ** Description Firdaws and Fatinah are living in a country with nn cities, numbered from 11 to nn.Each city has a risk of kidnapping or robbery. Firdaws’s home loc...

** ABBA ** 链接：https://ac.nowcoder.com/acm/contest/881/E?tdsourcetag=s_pcqq_aiomsg 来源：牛客网 题目描述 Bobo has a string of length 2(n + m) which consists of characters A and B. The string also has a fascinati...

题目描述 You are given two strings s and t composed by digits (characters ‘0’ ∼\sim∼ ‘9’). The length of s is n and the length of t is m. The first character of both s and t aren’t ‘0’. Please calculate t...

转载至：https://www.cnblogs.com/rookie-acmer/p/11258415.html number 题目描述 300iq loves numbers who are multiple of 300. One day he got a string consisted of numbers. He wants to know how many substrings in ...

How Many Groups You are given an array of n integers. Define a binary relation ~ on the elements of this array so that x ~ y if and only if |x – y| is less than or equal to 2. Let ~* be the transitive...