摘要：
create table dept(dname char(7),loc char(4),id number(7) primary key);//建表desc dept;//查找表所具有的属性alter table dept add ddate date;//修改table表 dept 增加名为当ddate属性为date的属性组select * from dept;//选择所有表元素alter table dept drop column ddate;//删除dept 中在ddate列insert into dept (dname,loc,ddate)values('12',&# 阅读全文
摘要：
touring computeTime Limit 1000msMemory Limit 65536KdescriptionThe best friends Mr. Li and Mr. Liu are touring in beautiful country M. M has n cities and m two-way roads in total. Each road connects two cities with fixed length.We assume that the cost of car traveling on the road is only related ... 阅读全文
摘要：
monkeyTime Limit 1000msMemory Limit 65536Kdescription Cc is a lovely monkey. It likes to play the game "catching plates". The game is as follows. There are n pegs in a line numbered from 1 to n. Cc stands on the first peg at the beginning. It is rather hard for Cc to jump from peg i to peg 阅读全文
摘要：
素数树Time Limit 1000msMemory Limit 65536KdescriptionSuppose there is a tree named A. All nodes of A have a weight v(0 #include
#include
#include
#include
#include
#include
using namespace std;
const int mm=4e6+9;
const int nn=5e4+9;
class node
{ public:bool vis,pri; int no,ma;
}f[nn];
int head[nn... 阅读全文
摘要：
D -Harry Potter and the Sorting HatTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 65DDescriptionAs you know, Hogwarts has four houses: Gryffindor, Hufflepuff, Ravenclaw and Slytherin. The sorting of the first-years into houses is done by the Sor 阅读全文
摘要：
湫湫系列故事——消灭兔子Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 612Accepted Submission(s): 231Problem Description 湫湫减肥 越减越肥！ 最近，减肥失败的湫湫为发泄心中郁闷，在玩一个消灭免子的游戏。 游戏规则很简单，用箭杀死免子即可。 箭是一种消耗品，已知有M种不同类型的箭可以选择，并且每种箭都会对兔子造成伤害，对应的伤害值分别为Di（1 #include
#include... 阅读全文
摘要：
基础知识点；所谓线段树，也就是一颗树，不过这棵树数管的是一个线段，而原本的树管的只是不同的点，其实本质上是一个道理。线段树算法主要由三部分组成，1建树，2更新3查询。就以其中第一题为例子#define lson t=id)update(lson,id,num); else update(rson,id,num); rt[t].beauty=rt[lson].beauty+rt[rson].beauty; }}/**询问某个区间，或某个点的具体情况*/int query(int t,int l,int r)///这是查询过程{ if(rt[t].l==l&&rt[t].r==r) 阅读全文
摘要：
Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4961Accepted Submission(s): 2624Problem DescriptionN个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a #include
#include
#define lson t=r)update(lson,l,r,rt[t].lazy+num); else if(rt[rson].l=id... 阅读全文
摘要：
E -Sweets GameTime Limit:3000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 63EDescriptionKarlsson has visited Lillebror again. They found a box of chocolates and a big whipped cream cake at Lillebror's place. Karlsson immediately suggested to divide the s 阅读全文
摘要：
C -Bulls and CowsTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 63CDescriptionThe "Bulls and Cows" game needs two people to play. The thinker thinks of a number and the guesser tries to guess it.The thinker thinks of a four-digit numbe 阅读全文