红点雷龙XL

题目描述The N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They know that tonight they will each try to pe...

题目描述While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time ...

题目描述Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river wit...

题目描述The cows are building a roller coaster! They want your help to design as fun a roller coaster as possible, while keeping to the budget.The roller coaster will be built on a long linear stretch...

链接：https://www.luogu.org/problemnew/show/P1019思路：搜索，标记判断；需要一个判断两个单词的连接情况，包括连接字母的数目a，需要一个结构体，word变量中需要包括字母数和剩余使用数，需要搜索以及对开头单词的搜索；代码：#include<iostream>#include<cstring>#include<algorith...

链接：https://www.luogu.org/problemnew/show/P1219思路：回溯，搜索，标记方法；可以用四个数组判断+标记；a[i]=j--可以表示第i行第j个； b[j]==1--表示这一行已经有了；c[i+j]==1--表示从左上到右下的对角线有了；d[i+n-j]==1--表示从右上到左下的对角线有了；代码：#include<iostream>using ...

#include<iostream>using namespace std;int a[1000010];int n;void paixu(int *a,int l,int r){ int mid; int i=l,j=r; mid=a[(l+r)/2]; do { while(a[i]<mid) ...

#include<iostream>using namespace std;int f[100001],l[100001],i,j,n,k,x,y,z,ans=0;int father(int x){    if(x==f[x]) return x;    else        {            int t1;            t1=f[x];            f...

#include<bits/stdc++.h>using namespace std;int f[10010],totalroad,ans=0;int i,j,n,m;struct EDG{    int x,y,t;}a[100001];bool cmp(EDG a,EDG b){    return a.t<b.t;}int father(int x){    if (f[x...

#include <bits/stdc++.h>using namespace std;int xx[1005],yy[1005],s,p;int i,j,f[1000005],total=0,alnum=0;double ans;struct point{    double x,y,v;}a[1000005];bool cmp(point a,point b){    return...

#include <bits/stdc++.h>using namespace std;int i,j,n,m,mmax;int f[100000];                                           //开大点，省的再改struct EDG{    int x,y,v;}node[100000];bool panduan(EDG a,EDG b){ ...

#include<bits/stdc++.h>using namespace std;struct node{    int x,y,w;}a[100000];                //w是权值int f[100000];bool cmp(node xx,node yy){    return xx.w<yy.w;           //从小到大}int find(i...

#include<iostream>#include<cstring>#include<cstdio>using namespace std;void find(string in,string after){    if(in.size()>0)    {        char ch=after[after.size()-1];        cout...

#include<iostream>using namespace std;char s[10010];void tree(int x,int y){    if(x<y)    {        tree(x,(x+y)/2);        tree((x+y+1)/2,y);    }    int B=1,I=1;    for(int i=0;i<=y-x;i++...

#include<iostream>#include<stack>using namespace std;int main(){    char a[300];    int i=0;    stack<char>m;    cin>>a;    while(a[i]!='@')    {        if(a[i]=='(')          ...

#include<iostream>#include<queue>using namespace std;int main(){    int n,m,i;    int id=1;      //记录输出的    queue<int>q;    cin>>n>>m;    for(i=1;i<=n;i++)        q.pu...