转角的守望

题意：给出n行  m列字符串请你找出某两行两列的相同如果有不同就输出no  再输出两行的行数  再输出两列的列数题解：输入的时候先将字符串映射到一个数字保存成一个二维数组然后枚举两列，判断哪两行满足题意这里的stl用的很活   可以多看看#include#include#include#include#includeusing name

IP AddressTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19666 Accepted: 11366DescriptionSuppose you are reading byte streams from any device, repres

Automatic EditingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1386 Accepted: 643DescriptionText-processing tools like awk and sed allow you to auto

Advanced FruitsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2195 Accepted: 1074 Special JudgeDescriptionThe company "21st Century Fruits" has s

两题运用kmp思路基本上是一样的，都是从头开始找相同前缀的  运用next数组原理，让你充分理解，即使不理解，你也记住了，哈哈poj 2406Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 44165 Accepted: 18

Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17251 Accepted: 8817DescriptionThe little cat is so famous, that many coup

#include#include#includeusing namespace std;char a[10005],b[1000005];int nexta[10005];void getnext(){ int len=strlen(a); nexta[0]=-1; int k=-1; int j=0; while(j { if(k==-1||a[

#include#includeint main(){ char dictionary[105][10]; char biao[105][10]; char a[10]; int pos=0; //开始输入 while(scanf("%s",dictionary[pos]),strcmp(dictionary[pos],"XXXXXX")) pos++; for(int i=0;i { for

Hints of sd0061Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 907    Accepted Submission(s): 240Problem Descriptionsd0061, the le

题目给的数据不是按照时间来的，而是打乱的，需要先进行排序输入数据后进行一次快排，结构体快排需要熟练然后进行统计各个队的成绩，注意可能会A了之后还会A或者WA一次之后再对统计结构进行排序：按照做题数目-> 时间 -> 序号   输出#include#include#includeusing namespace std;struct str{

找中位数#include#include#includeusing namespace std;#define father(i) (i>>1)#define left(i) (i<<1)#define right(i) (i<<1|1)#define swap(a,b) {int t=a;a=b;b=t;}int heap_size;int a[10010];

冒泡排序选择排序快排归并还有一些线性排序：桶排序  计数排序  基数排序等以后再来补充吧！！！首先，大家得知道一个知识点：有很多同学都不知道max min sort qsort swap 这些常见函数都在#in

1. 概述RMQ（Range Minimum/Maximum Query），即区间最值查询，是指这样一个问题：对于长度为n的数列A，回答若干询问RMQ（A,i,j）(i,j当然，该问题也可以用线段树（也叫区间树）解决，算法复杂度为：O(N)~O(logN)，这里我们暂不介绍。 2.RMQ算法对于该问题，最容易想到的解决方案是遍历，复杂度是O(n)。但当数据量非常大且

Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4582 Accepted: 3033 Special JudgeDescriptionThe system of Martians' blood relatio

Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32630 Accepted: 11343DescriptionAn ascending sorted sequence of distinct values is o

The RaceTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 3685 Accepted: 756Case Time Limit: 3000MSDescriptionDuring the Annual Interstellar Comp

Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 39924 Accepted: 13022DescriptionFarmer John wants to repair a small length of the fence ar

Black BoxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10376 Accepted: 4275DescriptionOur Black Box represents a primitive database. It can save an