u013497977的专栏

#include#include#include#includeusing namespace std;char a[305][305];int main(){int i,j,k,m,n,ans;while(cin>>k){ans=0;int temp=0,s=0;for(i=1;i>a[i][j];for(i=2;i<=k;i++)if(a[i][i]==a[1][1]&&a[i][k-i+1]

A. Lala Land and Apple Trees time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Amr lives in Lala Land. Lala La

机智题，分别算两个现在到公元的天数，相减 #include int sum(int y,int m,int d) { int x[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int i,s=0; for(i=1;i<y;i++) if((i%4==0 && i%100!=0 )|| i%400==0) s+=366;//闰年 else s+=365

CF 115B. Lawnmower http://www.codeforces.com/problemset/problem/115/B     贪心。由于每次必须将整行的走完，而且不能变换方向，由此可知每次都是走极端。 非常好的题。每次必须从端点开始扫。 偶数行（0也算）从左开始 奇数行从右开始往左扫。记录上一次的位置。坐标绝对值之差即为距离。 #include #include

A. 2Char time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Andrew often reads articles in his favorite magazine 2Char.

分类： 模拟 CF2015-10-26 14:22 58人阅读 评论(0) 收藏 举报 B. Rebranding time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The name of one

这道题对技巧和思维都是不错的锻炼。求出现最多次数的那个数在保持出现次数不变的情况下数组的最短长度。 思路： 1用一个vis数组来标记数组中每个数字出现的次数，可以边输入边判断，在线性时间内处理处出现次数最多的次数。注意不是那个数，因为出现的最大次数相同的数可能有多个。 2线性时间扫一遍，处理处每个数的最左和最右端点的编号和区间的长度。 3线性时间再扫一遍，这次只要在出现最大次数相同的数之间比较区间，即可找出出现次数最大且长度最短的子数组。

#include #include #include #include #include using namespace std; #define maxn 1005 #define inf 0x3f3f3f3f char s1[maxn],s2[maxn]; int main() { int n; cin>>n; cin>>s1>>s2; int d=0;

B. Anton and currency you all know

A. Tavas and Nafas time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Today Tavas got his test result as an int

A. Fox And Snake time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Fox Ciel starts to learn programming. The

#include #include using namespace std; int main() { int i,j,k,m,n,a[105]; while(cin>>k) { for(i=0;i<k;i++) cin>>a[i]; sort(a,a+k); cout<<a[0]; for(i=1;i<k;i++) cout<<" "<<a[i]; cout

time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The R1 company wants to hold a web search championship. There wer

A. Mashmokh and Lights time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Mashmokh works in a factory. At the e

B. Mashmokh and Tokens time limit per test  1 second memory limit per test  256 megabytes input  standard input output  standard output Bimokh is Mashmokh's boss. For th

ai和s+1-ai是对称的，所以反转偶数次的相当于没翻转，奇数次的要翻转，所以我们只要统计每个字母翻转的次数，用前缀和处理。

A. Drazil and Date time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Someday, Drazil wanted to go on date with

A. New Year Transportation time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output New Year is coming in Line World

Om Nom and Dark Park time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Om Nom is the main character of a game

A. Pasha and Pixels time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Pasha loves his phone and also puttin