nextcy的专栏

   淋着大雨晚上9点赶到湘潭，浑身湿淋淋的，唉，仿佛就暗示着我们将是一次杯具，晚上一个人一间房看着电视不知不觉就来到了12点，熄灯睡觉，7点被叫醒。   还是大雨临盆，匆匆吃完早餐，来到开幕式的地点，还么听清楚讲什么，就完了，直奔赛场。   比赛ing：   我是这次比赛最杯具的一个，全场漫游，不知道大脑在想些什么。前两个小时都是小飞和haven在做，我在YM。3道水题还是早早解决，

                                                                               Simply SyntaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3194 Accepted: 1426

                                                                                        ZipperTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7844 Accepted: 2637

                                                                                        TravelTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2643 Accepted: 1108

                                                                                 Magazine DeliveryTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1438 Accepted: 668

                                                                                        JackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 910 Accepted: 309

                                                                     A Mysterious FunctionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2936 Accepted: 1957

                                                                          Cake Pieces and PlatesTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 5123 Accepted: 1424

                                                                              Lucky ticketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1952 Accepted: 1237

                                                                                  Pascals TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3697 Accepted: 1583

                                                                                          DivisibilityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6012 Accepted: 1

                                                                                                                                                     Two EndsTime Limit: 1000MS Memory Lim

                                                                         CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2452 Accepted: 1187 Special Jud

                                                                               Bridging signalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5155 Accepted: 2849

http://162.105.81.212/JudgeOnline/problem?id=1944 题意：一个圆图，只能相邻的两点连接，给出一些想连接的点对，求用最少的边将这些点连接思路：枚举+贪心，枚举n个断点，求出最大的断点#include #include #include using namespace std;int n,a[10001][2],p,dp[10

<br />题意：很简单，就不重复了。<br />我只能说在哥面前一切都是模拟。呵呵 <br />#include <iostream>using namespace std;int t,v[300],d[300];char s[300],ans[300];int main(){ scanf("%d",&t); getchar(); while(t--) { gets(s); int i,j=0;

    好久没有写博客了，上周参加了由国防科大举办的"2010 ACM-ICPC中南地区赛",热身赛时只出了两道题，回来的时候我们还在讨论明天是不是要被我们学校的神牛队拉开很多。    正式开始比赛，很快进入状态，我写了A题，1Y。首先YM自己一下，呵呵。然后进入了拉锯战，在C题上我们浪费了太多的时间，基本上每个人都写了一份代码，最后还是由小飞A了，出第二道C题的时候我们已经用了近2个半小时，

                                                                                    Gone FishingTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 15639 Accepted: 4356

二分图匹配二分图最大匹配的匈牙利算法 二分图是这样一个图，它的顶点可以分类两个集合X和Y，所有的边关联在两个顶点中，恰好一个属于集合Ｘ，另一个属于集合Ｙ。 最大匹配： 图中包含边数最多的匹配称为图的最大匹配。 完美匹配： 如果所有点都在匹配边上，称这个最大匹配是完美匹配。 最小覆盖： 最小覆盖要求用最少的点（Ｘ集合或Ｙ集合的都行）让每条边都至少和其中一个点关联。可以证明：最少的点（即覆盖数）＝

还是线段树，不过有点复杂，虐了我两天，WA了无数次，呵呵。#include #include #include using namespace std;struct node{ int left,right,lval,rval,cval; int dis() { return right-left+1; }

第一道线段树    #include using namespace std; const int sup=8010; int ans[sup]; struct node { int left,right; int color; node *rch,*lch; node(int beg,in

首先膜拜一下自己，竟然只交了一次就A了，太高兴了，呵呵。其实线段树真的没有什么好讲的，全靠建树，再更新，查询。#include using namespace std;struct node{ int left,right,num;}st[300020]; int n,m,ans;void bulid(int x,int y,int pos){

开始我写的时候是用链表的，但是一直超内存，就换成树状数组，这题是线段树的一道水题，写了近一天，郁闷，还是写的太少，太菜了，鄙视自己。建树，在查询和更新。#include #include using namespace std;struct node{ int left,right,num; //node *lch,*rch; }st[60000

这是本人第一次自己写的线段树，也是一个比较简单的线段树，题目是中文，就不用复述了。建树，然后进行更新，查询。#include #include using namespace std;struct node{ __int64 left,right,num; node *lch,*rch; };int n,a[50001],sum;char

题意：给你一个长方形，有三种字符表示，从中找出两条从(1,1)到(h,w)的路使他们走过的*最多，且只能想第一次走过的第二次就不算了。开始做这题，以为找到方法了，谁知道是错误的，开始的方法是，先找出一条含*最多的路，然后将这条路的*变换.，然后再找出一条最多的路来，谁知道第二个案例都通过不了，细想之下，惨知道有一个很大的漏洞，你们可以根据第二个案例来想想，后来在一本书上看到一种解法

                                                                                           FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3120 Accepted: 220

                                                                                     BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1414 Accepted: 683

Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3961 Accepted: 910DescriptionWindy has N balls of distinct weights from 1 unit to N unit

                                                                         Brackets Sequence Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10741 Accepted: 2856 Sp

                                                                                          PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 26850 Accepted: 89

                                                                         The Cow LexiconTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2860 Accepted: 1255D

HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6978 Accepted: 3308DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flat

                                                                                          Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11398 Accepted: 4755

                                                                            Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9021 Accepted: 2958

                                                                                   Constructing RoadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10239 Accepted: 4

                                                  UNIMODAL PALINDROMIC DECOMPOSITIONSTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2893 Accepted: 1335Desc

                                                                                   Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4697 Accepted: 1681

SubstringsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4233 Accepted: 1411DescriptionYou are given a number of case-sensitive strings of alphabetic cha

                                                                       Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 605 Accepted: 441 Special

                                                                                           TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4720 Accepted: 2280