命运在指间

题意：   给你一个串s，让你去计算一下有多少符合串中相同字母的个数不大于k值的子串的数目思路： 尺取法； 设两个指针h，t，让t 向右移动，确保现在的子串满足题目要求，不满足的话，把h向右移动，直到满足为止，当t到串的尾部停止；CODE#include#include#include#define LL __int64int a[30]; char s[1100

题目意思 ： 排序二叉树，直接上就行了CODE#include#include#include#include#includeusing namespace std;struct node{ int x; struct node *l, *r;};char mp[1010][1010];node *head;void juge()///小的是右边E

题目意思：   很简单，让你去求一段区间里面的最大的值思路：    RMQCODE#include#include#include#include#includeusing namespace std;int mx[51000][50];int ls[51000];int n, m;void RMQ_max()///大的{ int i, j;

题目意思： 从中选择任意的数进行异或运算，看有多少异或运算的结果大于给定值思路：dp[ i+1][j] += dp[i][j];dp[i+1][j^a[i]] += dp[i][j];code#include #include#include#include#define LL long longusing namespace std;const

模板题CODE#include#include#include#include#include#include#define esp 1e-8using namespace std;struct Circle{ double x,y; double r;};double calArea(Circle c1, Circle c2){ dou

double calArea(Circle c1, Circle c2){ double d; double s,s1,s2,s3,angle1,angle2,temp; d=sqrt((c1.x-c2.x)*(c1.x-c2.x)+(c1.y-c2.y)*(c1.y-c2.y)); if(d>=(c1.r+c2.r))//两圆相离 return

题意思：题目大意：一场比赛，赢的得A分，输的得C分，平手都得B分。有n支队伍，分别比赛一次，选前m个队伍晋级（分数相同的随机排名）。问：可能的最大落榜分数，可能的最小晋级分数。思路：首先若A＜C，交换A和C。考虑第一个问题，贪心地让分数都尽量集中到前m+1个队伍身上，那么就要后n-m-1个队伍都给m+1个队伍最多的分数，即max{A, B}。那么前m+1个队伍的竞技中，希望分数

思路：从后向前扫一遍就行了CODE#include #include#include#includeusing namespace std;int ls[1000100];int main(){ int t; scanf("%d",&t); int io = 1; while(t--) { int n, i;

题目意思：  要求所给时间段最快的速度思路： 签到题，水过CODE#include #include#include#includeusing namespace std;struct node{ double t; double s;}ls[1000100];bool cmp(node x,node y){ return x.t

题目意思：  给你一组排序二叉树，让你输出节点的方向，小的是E，大的是WCODE#include#include#include#include#includeusing namespace std;struct node{ int x; struct node *l, *r;};char mp[1010][1010];node *head;voi

//Dijkstra-感觉和prim很像，就是很像#include#include#include#define MAX 0x3f3f3fint map[150][150];int dis[150];int n;int bj[150];void dijkstra(){ memset(bj,0,sizeof(bj)); memset(dis,0,sizeof(d

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0Problem Description MZL define F(X) as the firs

思路很简单：代码：#include#include#includeint main(){ int x, y, w, n; while(~scanf("%d%d%d%d",&x,&y,&w,&n)) { int key = x/w+1;///一次几个 int d = n/key;///第几次 int dx =

题意： 实际内存和标号内存是有区别的，现在问你差别多大思路：    模拟，用POW足以解决CODE#include#include#include#include#include#includeusing namespace std;char b[9][5]={"B]","KB]","MB]","GB]","TB]","PB]","EB]","ZB]","YB

题意：题目的意思是给你一些白色边和黑色边，现在问你能否用两色边构造出一颗生成树，且树中白色边的数量为一个Fibonacci数。思路：   构造最大生成树和最小生成树；   先去判断是否为联通图，不联通的就输出NO   计算里面白边的值，看在这个范围内有没有Fibonacci的数CODE#include#include#include#include#incl

Problem DescriptionIn this problem, we should solve an interesting game. At first, we have an integer n, then we begin to make some funny change. We sum up every digit of the n, then insert it to

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 377    Accepted Submission(s): 200Problem DescriptionGive a time.(hh:mm:ss)，you should

Problem DescriptionRecently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of the chesserboard is n*m.First of all, a coin

Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an array B is defined as B1 xor B2...xor Bn 

Problem Descriptionsoda has a set $S$ with $n$ integers $\{1, 2, \dots, n\}$. A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subset

#include#include#includeint ls[2000000],_hash[2000000], d[2000000];int find1(int x){ return ls[x] == x ? x : ls[x]=(find1(ls[x]));}void add(int x, int y){ int xx = find1(x); int y

题目意思：     很明白CODE#include #include #include #include #include using namespace std;int a[30];bool f[30];int main(){ int ls[30]; int t; scanf("%d",&t); while(t--) {