algorithm
未读Manacher回文串高效算法
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394import java.util.*;import java.io.*;//Manacher算法public class Main{ public static void main(String args[]) { int n=in.nextInt();//n长度的字符串 String str=in.next();//字符串 StringBuilder sb=new StringBuilder();//可修改字符串 for(int i=0;i<str.length();i++) {//变成#字符串#格式去除奇偶性 sb.append("#&quo ...
字符串单哈希，单哈希有可能被卡哈希值
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081import java.util.*;import java.io.*;//字符串单哈希public class Main { static int mod=998244353;//哈希模数 static int p=131;//哈希倍率 static String str; public static void main(String args[]) { int n=in.nextInt();//长度n的字符串 int q=in.nextInt();//q次询问 str=" "+in.next();//从1开始的字符串 init();//初始化字符串哈希 while(q-->0) & ...
algorithm
未读线段树，支持单点修改，区间查询
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102import java.util.*;import java.io.*;//线段树(单点修改，区间查询)public class Main { static int a[]; public static void main(String args[]) { a=new int[N]; for(int i=1;i<=100;i++) { a[i]=i; } build(1,1,100);//建树区间1-100 out.println(query(1,1,100));//区间1-100的sum和 out.fl ...
