01 string string string
首先用后缀数组预处理出height,用f(l,r)表示区间最小,那么最终答案就是f(l,r)-max(f(l-1,r),f(l,r+1))
代码:
#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MEM(a,b) memset(a,b,sizeof(a))
using namespace std;
const int MAXN = 5e5+100;
int t1[MAXN], t2[MAXN], c[MAXN],n;
bool cmp(int *r, int a, int b, int l)
{
return r[a] == r[b] && r[a + l] == r[b + l];
}
void da(int str[], int sa[], int zrank[], int height[], int n, int m){
n++;
int i, j, p, *x = t1, *y = t2;
//第一轮基数排序,如果s的最大值很大,可改为快速排序
for (i = 0; i < m; i++)c[i] = 0;
for (i = 0; i < n; i++)c[x[i] = str[i]]++;
for (i = 1; i < m; i++)c[i] += c[i - 1];
for (i = n - 1; i >= 0; i--)sa[--c[x[i]]] = i;
for (j = 1; j <= n; j <<= 1){
p = 0;
//直接利用sa数组排序第二关键字
for (i = n - j; i < n; i++)y[p++] = i;//后面的j个数第二关键字为空的最小
for (i = 0; i < n; i++)if (sa[i] >= j)y[p++] = sa[i] - j;
//这样数组y保存的就是按照第二关键字排序的结果
//基数排序第一关键字
for (i = 0; i < m; i++)c[i] = 0;
for (i = 0; i < n; i++)c[x[y[i]]]++;
for (i = 1; i < m; i++)c[i] += c[i - 1];
for (i = n - 1; i >= 0; i--)sa[--c[x[y[i]]]] = y[i];
//根据sa和x数组计算新的x数组
swap(x, y);
p = 1; x[sa[0]] = 0;
for (i = 1; i < n; i++)
x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;
if (p >= n)break;
m = p;//下次基数排序的最大值
}
int k = 0;
n--;
for (i = 0; i <= n; i++)zrank[sa[i]] = i;
for (i = 0; i < n; i++){
if (k)k--;
j = sa[zrank[i] - 1];
while (str[i + k] == str[j + k])k++;
height[zrank[i]] = k;
}
}
int m_rank[MAXN], height[MAXN];
int RMQ[MAXN];
int mm[MAXN];
int best[30][MAXN];
void initRMQ(int n){
mm[0] = -1;
for (int i = 1; i <= n; i++)
mm[i] = ((i&(i - 1)) == 0) ? mm[i - 1] + 1 : mm[i - 1];
for (int i = 1; i <= n; i++)best[0][i] = i;
for (int i = 1; i <= mm[n]; i++)
for (int j = 1; j + (1 << i) - 1 <= n; j++){
int a = best[i - 1][j];
int b = best[i - 1][j + (1 << (i - 1))];
if (RMQ[a]<RMQ[b])best[i][j] = a;
else best[i][j] = b;
}
}
int askRMQ(int a, int b){
int t;
t = mm[b - a + 1];
b -= (1 << t) - 1;
a = best[t][a]; b = best[t][b];
return RMQ[a]<RMQ[b] ? a : b;
}
char str[MAXN];
int r[MAXN];
int sa[MAXN];
int Q[MAXN];
int lcp(int a, int b){
//a = m_rank[a]; b = m_rank[b];
if(a==b) return n-sa[a];
if (a>b)swap(a, b);
return height[askRMQ(a + 1, b)];
}
int main() {
int t, k;
scanf("%d", &t);
while (t--) {
scanf("%d", &k);
scanf("%s", str);
n = strlen(str);
for (int i = 0; i < n; i++)r[i] = str[i];
r[n] = 0;
da(r, sa, m_rank, height, n, 256);
long long ans = 0;
for (int i = 1; i <= n; i++) {
RMQ[i] = height[i];
}
initRMQ(n);
memset(Q, 0, sizeof(Q));
for (int i = 0; i+k<=n; i++) {
Q[i+1] = lcp(i+k,i);
}
int ret;
ans=0;
for (int i = 0; i+k-1 <=n; i++) {
ret=lcp(i+k-1,i);
ans = ans+(long long)max(0,ret-max(Q[i], Q[i+1]));
}
printf("%lld\n", ans);
}
return 0;
}
08 transaction transaction transaction
树分治,NlogN,可以树dp的,就是oN了
代码:
#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define MEM(a,b) memset(a,b,sizeof(a))
typedef long long ll;
const ll mod = 1e9+7;
const int maxn =1e6+10;
int n,t;
int ans,root,Max;
struct node{
int v,next,w;
}edge[maxn*2];
int head[maxn],tot,num1,num2;
int si[maxn],maxv[maxn],vis[maxn];//vis标记重心
int dis[maxn],a[maxn],tmpsell,tmpbuy;
void init(){
tot=ans=0;MEM(head,-1);MEM(vis,0);
}
void add_edge(int u,int v,int w){
edge[tot].v=v;edge[tot].w=w;edge[tot].next=head[u];head[u]=tot++;
}
//处理子树的大小(固定)
void dfssi(int u,int f){
si[u]=1;
maxv[u]=0;
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].v;
if(v==f||vis[v])continue;
dfssi(v,u);
si[u]+=si[v];
if(si[v]>maxv[u])maxv[u]=si[v];
}
}
//找重心(固定)
void dfsroot(int r,int u,int f){
if(si[r]-si[u]>maxv[u])//si[r]-si[u]是u上面部分的树的尺寸,跟u的最大孩子比,找到最大孩子的最小差值节点
maxv[u]=si[r]-si[u];
if(maxv[u]<Max)Max=maxv[u],root=u;
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].v;
if(v==f||vis[v])continue;
dfsroot(r,v,u);
}
}
//求每个点到u的距离(自定义)
void dfsdis(int u,int d,int f){
tmpsell=min(tmpsell,d-a[u]);
tmpbuy=min(tmpbuy,d+a[u]);
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].v;
if(v!=f&&!vis[v])//不跨过其他重心
dfsdis(v,d+edge[i].w,u);
}
}
//分边解决一个重心的答案(自定义)
int calc(int u,int d){
int ret=0;
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].v,w=edge[i].w;
if(!vis[v]){
tmpsell=tmpbuy=1e9+10000;
dfsdis(v,w,0);
ret=max(ret,-a[u]-tmpsell);
ret=max(ret,a[u]-tmpbuy);
ret=max(ret,-tmpsell-tmpbuy);
}
}
return ret;
}
void dfs(int u){
Max=n;
dfssi(u,0);//重心预处理
dfsroot(u,u,0);//找重心
vis[root]=1;
ans=max(ans,calc(root,0));//合并贡献(固定?)
for(int i=head[root];i!=-1;i=edge[i].next){
int v=edge[i].v;
if(!vis[v])dfs(v);
}
}
int main(){
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
int u,v,w;
init();
for(int i=1;i<n;i++){
scanf("%d%d%d",&u,&v,&w);
add_edge(u,v,w);add_edge(v,u,w);
}
dfs(1);
printf("%d\n",ans);
}
return 0;
}
12 card card card
题目意思就是走一圈,从哪里开始走,过程中总和不会小于0,那么求一下前缀和,从最小的开始走就行了。
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const int maxn =2e6+10;
ll n,t,a[maxn],x;
int main(){
while(scanf("%lld",&n)!=EOF){
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
for(int i=1;i<=n;i++) scanf("%lld",&x),a[i]-=x;
int ans=0;
ll sum=0;
for(int i=2;i<=n;i++) a[i]+=a[i-1];
for(int i=1;i<=n;i++) if(a[i]<sum) sum=a[i],ans=i;
printf("%d\n",ans%n);
}
return 0;
}