morejarphone~

C. Bear and Forgotten Tree 3 time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A tree is a connected undirect

Wow! Such String! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1216    Accepted Submission(s): 401 Special Judge Problem Description

链接:点击打开链接 题意:构造出一个矩阵,使得矩阵含有n条蛇,每条蛇的长度是1到n,并且奇数长度的蛇有奇数个拐弯,偶数长度 的蛇有偶数个拐弯. 奇数和偶数分开构造,奇数可以是: 1357 3357 5557 7777 这样一直构造下去,偶数可以这样: 2266 4466 4466 8888 8888 不断的放右边和放下面. 然后预处理每一个蛇的每一个坐标,然后考虑一下

E. Intellectual Inquiry time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output After getting kicked out of her rep

A. Mashmokh and Numbers time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output It's holiday. Mashmokh and his boss,

361. National Flag Time limit per test: 0.25 second(s) Memory limit: 65536 kilobytes input: standard output: standard Series of bloody civil wars in Berland finished! After the long-a

D. Simple Subset time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A tuple of positive integers {x1, x2, ..., 

Cake Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2759    Accepted Submission(s): 576 Special Judge Problem Description There a

题目链接：点击这里题意：依次给出从左到右每一个左括号到与其匹配的右括号的距离范围，求出一个合法的括号序列。注意到如果一个括号他的右括号已经可以放了那么就可以直接放上去。那么直接先把左括号扔进一个栈，并且记录下所有栈中的左括号在没找到与之匹配的右括号之前中间长度增加了多少。扫一边就好了。#include <cstdio> #include <iostream> #include <cstring> #