❂

//sa[i]表示排名为i是从sa[i]位置开始的后缀//rank[i]表示起始位置的下标为i的后缀的排名// height[i]表示排名相邻的两个后缀的最长公共前缀长度//参考后缀数组（非常清楚）https://www.cnblogs.com/victorique/p/8480093.html//#include<bits/stdc++.h>#include&...

#include <string.h>#include<iostream>#include <stdio.h>const int V = 105; const int E = 1005;const int inf = 0x3f3f3f3f;using namespace std;struct edge { int to, next...

感觉这道题可能有例外,比如都空的情况....，在string 类型里, 初始化时 用s21 += s12 会WA 然后 用s21 = s12就AC了....还有就是为什么要在刚开始给s21赋值呢..我是因为不初始化，就算s21[i]赋值了，，输出s21 仍然空....所以就试着赋了下值...就有结果了......#include<iostream>using namesp...

模板题//RMQ的两种实现方法#include<cstdio>#include<iostream>#include<cmath>using namespace std;const int N=50010;int a[N], dpMax[N][30], dpMin[N][30];//查询数组a的[l,r]区间的最值int RMQ...

喜欢他的离散化方法，但是，看别人的解释他的方法有问题就是131 101 46 10结果是2，但实际结果应该是3，解决方法得等我勤快起来才能写了.....转自https://blog.youkuaiyun.com/u013569304/article/details/51276536//线段树D #include<iostream>#i...

//已修改#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n;struct node{ int val, index;}a[500010];//最初的输入 int c[500010];//c[x]存储在区间 （...

写这个，，主要是看到了用vector来模拟邻接表，就http://www.cnblogs.com/yimao/archive/2012/06/26/2563262.html的思路来了一遍#include<iostream>#include<cstdio>#include<vector>#include<queue>#inclu...

#include<iostream>#include<algorithm>using namespace std;int main(){ int T, n; cin >> T; while(T--){ cin >> n; int a[n+5]; int dp[n+5]; for(int i=1; i<=n; ...

//出现RE后，将数组大小开大，就好了。//把int改为long long 就由WA变为AC了//区间更新//参见 https://blog.youkuaiyun.com/SSL_ZYC/article/details/81940902 http://kenby.iteye.com/blog/962159#include<iostream>#include<cst...

#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;queue&gt;#include&lt;cstring&gt;using namespace std;const int N = 1e6+5;int n, m, Max;struct Edge{ int u, v, dist; Edge(){...

,,,原因是visited数组={0}开在了局部变量里.....但是还是不明白。。。。#include &lt;iostream&gt;#include &lt;cstdio&gt;#include &lt;climits&gt;const int N = 2000+25;char s[N][N];int m[N][N]={0};int n;using namespace ...

//刚开始看错题了..看例子以为给你n行，每行意思为a, b之间的距离为dist.（有向）.一直找不到自己错在哪 ,,, 然后....看了看别人的发现是无向....n*n位邻接矩阵.............#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;queue&gt;#include&lt;cstring&gt...

//要注意清空队列（全局）或者写进函数里 #include &lt;iostream&gt;#include &lt;cstdio&gt;#include &lt;queue&gt;using namespace std;const int MAX = 8;int dirx[MAX] = {-2,-2,2,2,-1,-1,1,1}, diry[MAX] = {1,-1,-1,...

//二进制枚举//遇到的问题就是在判断某点当前状态时，感觉可以不考虑当前位置的翻转，毕竟不会存在翻了一次又翻一次的状况....但是 当取消这一情况，就会WA。。。。后来发现是第一行初始化的时候，flip会取1.....所以....就需要考虑自身是否翻转了...#include<iostream>#include<cstdio>#include<cst...

/*每个点到指定点的距离+指定点回到各个点的距离*//*每指定点到每个点之间的逆序+指定点到每个点之间的正序*/ #include<iostream>#include<vector>#include<cstring>#include<algorithm>using namespace std;const int N = 1000...

//AC版 #include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std ;string s, t;int len, MAX = 0;...

//就是直接拿的最少拦截系统 的代码 不过不能用万能头文件#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm> using namespace std;#define MAXN 40005i...

#include<iostream>#include<cstdio>#include<string.h>#include<cmath>#include<cstdlib>using namespace std;const int N = 1e3+5;int nxt[N];int cnt = 0;string s[1...

//刚开始数组开的太大了1e6，OLE了，， 后来看错了开的太小4*1e4...RE.。。。后来发现题目要求4*1e5.。。AC//字符串s的前next[i]长度的字符和后next[i]长度的字符是相同的#include<iostream>#include<cstdio>#include<cstring>#include<cmath&g...

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>using namespace std;const int N = 1e6+5;int nxt[N];int cnt = 0;char s1[N],...

算次小生成树模板吧，prim的话。。。应该就是更新MAX数组的时候,不是直接=，语句是MAX[u][v] = MAX[v][u] = max(MAX[pre[u]][v], dis[u]);//dis[u] = MAX[u][pre[u]]//心累....第一次拿map做标记，然后，，就遇到问题了，，，拿样例二就会发现，计入map的大小不对....然后，就会发现，由于first是Edge，...

这个算spfa模板吧...本来想用来解Til the Cows Come Home POJ - 2387 ，但是。。有重边....所以。用邻接表的话..重边问题我暂时不知道怎么解决...只能用邻接矩阵做了..然后 这个就用作spfa模板吧感觉。。。如果用队列的话，迪杰斯特拉和spfa之间应该就是vis[]用处不同了....毕竟,spfa可以判断负回环#include <i...

//判断条件写错了,导致没结果，然后就是最高位不能为0，否则会导致结果出错....Both numbers are four-digit primes (without leading zeros)....../*思路：因为要找最少变换素数次数，所以，用bfs解，每次每位由0-9选择，存入队列，直到符合最终结果，此时步数为最短步数*/#include<iostream>...

#include<iostream>#include<cstdio>#include<queue>#include<cstring>using namespace std;const int N = 1000+5;struct Edge{ int u, v, dist; Edge(){ u = 0...

#include<iostream>#include<cstdio>#include<queue>#include<cstring>using namespace std;const int N = 1000+5;struct Edge{ int u, v, dist; Edge(){ u = 0...

不标记，直至起始位置的dis大于初始即为YES，还有一种做法是判断某一点的遍历次数是否大于n,若大于n，即为有回环#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <stack>#include <vec...

//7.9做的....但是当时RE了，就不想在调试了....今天重看了下，发现输入少了个条件，即不为0#include<iostream>#include<cstdio>#include<cmath>using namespace std;typedef unsigned long long LL;bool flag;void dfs(L...

//读取C的时候没有！=EOF 会出现TLE的错误..... #include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;algorithm&gt;using namespace std;const int N = 10000+5;pair&lt;int, int&gt; a[N];int pre[N], store[...

/* * * *想用结构体做下，结果一直RE，1 40000,不会有结果。用数组做了就AC了....待解决 #include&lt;iostream&gt;#include&lt;cstdlib&gt;#include&lt;queue&gt;#include&lt;string.h&gt;#include&lt;cstdio&gt;using namespace std...

 In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by length (so that e...

Pascal University, one of the oldest in the country, needs to renovate its Library Building, because after all these centuries the building started to show the effects of supporting the weight of the ...

Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose ...

The king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold coin. On each of the next two days (the second and third days of service), the knight receiv...

In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the digits of n. (The d stands for dig...

Bill and Ted are taking a road trip. But the odometer in their car is broken, so they don't know how many miles they have driven. Fortunately, Bill has a working stopwatch, so they can record their sp...

Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many tim...

转自 海岛Blog转这篇文章主要是对19行的代码有点不明白，因为本人调试的代码，bitset不赋初值则位上的数都为0， 但是，把该段删除后WA,不明白。/* POJ2943 UVALive3524 The Cow Doctor */ #include &lt;iostream&gt;#include &lt;bitset&gt;#include &lt;math.h&gt; ...

From the article Number Theory in the 1994 Microsoft Encarta: ``If a, b, c are integers such that a = bc, a is called a multiple of b or of c, and b or c is called a divisor or factor of a. If c is no...

Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by 50 square ...

Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two repre...