<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[CSUST_ACM的专栏]]></title><description><![CDATA[长沙理工大学ACM]]></description><link>https://blog.csdn.net/CSUST_ACM</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; CSUST_ACM]]></copyright><item><title><![CDATA[简说期望类问题的解法]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/8018422</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/8018422</guid><author>CSUST_ACM</author><pubDate>Tue, 25 Sep 2012 20:15:55 +0800</pubDate><description><![CDATA[转自：http://kicd.blog.163.com/blog/static/126961911200910168335852/
近年的acm竞赛中，数学期望问题常有涉及，在以前也常让本人感到很头疼，近来突然开窍，掌握了基本的分析方法，希望对大家有帮助。写得浅薄，可能数学上不够严谨，只供理解。
           
首先，来看下期望有啥基本的公式。
对离散型随机变量x，其概率为p，有]]></description><category></category></item><item><title><![CDATA[hdu 4419 Colourful Rectangle 杭州赛区 1010 （解题报告）]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/8018405</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/8018405</guid><author>CSUST_ACM</author><pubDate>Tue, 25 Sep 2012 20:11:40 +0800</pubDate><description><![CDATA[杭州赛区最后一题。。。。
最近看线段树还是有收获的·~~~
#include
#include
#include
#include

#define ls rt<<1
#define rs rt<<1|1
#define lson l,m,ls
#define rson m+1,r,rs
#define sf scanf 
#define pf printf
using]]></description><category></category></item><item><title><![CDATA[hdu 4409 Family Name List 金华赛区1010 （解题报告）]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/8018052</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/8018052</guid><author>CSUST_ACM</author><pubDate>Tue, 25 Sep 2012 17:55:34 +0800</pubDate><description><![CDATA[金华赛区区域赛最后一题，比赛完后就马上给A了 = =！ 哎~~~
#include
#include
#include
#include
using namespace std;
const int N = 30000 +5 ;
//46MS 13568K 3213 B 

//字典树+模拟，这题真心无语了，比赛时就被题意坑了，在c询问的时候，我考虑了a是b的
//父节点的情况]]></description><category></category></item><item><title><![CDATA[HDU 1540  Tunnel Warfare（平衡树） 解题报告]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/8001627</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/8001627</guid><author>CSUST_ACM</author><pubDate>Thu, 20 Sep 2012 20:15:55 +0800</pubDate><description><![CDATA[一道看似线段树的题，用平衡树也破了。。。。
/*
 * 题意：有N个村庄，相邻点相连，可以毁坏某个点或修复毁坏点，求某点的最大联通点数。
 * 方法：平衡树。 
 * 分析：最最朴素的想法就是把破坏的村庄做一个标记，然后遇到Q的时候，就循环的找一
 * 下答案，当然这么做肯定是会超时的设想一下，如果能够很快的找到距离某个点最近的
 * 两个被破坏掉的点，那么答案就很容易得到了于是用到了]]></description><category></category></item><item><title><![CDATA[线段树与树状数组模版及专题练习]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7988967</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7988967</guid><author>CSUST_ACM</author><pubDate>Mon, 17 Sep 2012 19:17:18 +0800</pubDate><description><![CDATA[专题练习：
http://acm.hdu.edu.cn/webcontest/contest_show.php?cid=1441
密码是: cugbacm
 
 
首先是准备工作，以下是常见的线段树初始定义：
#include
#include
using namespace std;
typedef __int64 lld;
#define ls rt<<1
#define]]></description><category></category></item><item><title><![CDATA[poj2635The Embarrassed Cryptographer(数论)(解题报告)]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7988776</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7988776</guid><author>CSUST_ACM</author><pubDate>Mon, 17 Sep 2012 18:05:10 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=2635





Language:
The Embarrassed Cryptographer




Time Limit: 2000MS





Memory Limit: 65536K




Total Submissions: 10080





Accepted: 26]]></description><category></category></item><item><title><![CDATA[ZOJ 2971 Give Me the Number]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7983454</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7983454</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 23:50:22 +0800</pubDate><description><![CDATA[题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2971

ZOJ Problem Set - 2971

Give Me the Number

Time Limit: 2 Seconds 
Memory Limit: 65536 KB 

Numbers in English are writ]]></description><category></category></item><item><title><![CDATA[ZOJ 2966 Build The Electric System]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7983447</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7983447</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 23:48:26 +0800</pubDate><description><![CDATA[题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2966

Build The Electric System

Time Limit: 2 Seconds 
Memory Limit: 65536 KB 


In last winter, there was a big snow storm i]]></description><category></category></item><item><title><![CDATA[ZOJ  2965 Accurately Say "CocaCola"!]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7983436</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7983436</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 23:44:38 +0800</pubDate><description><![CDATA[题目链接： http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2965

原题链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2965


2012年9月15日组队赛

Accurately Say "CocaCola"!

Ti]]></description><category></category></item><item><title><![CDATA[ZOJ 2969 Easy Task]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7983408</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7983408</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 23:26:02 +0800</pubDate><description><![CDATA[题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2969

ZOJ Problem Set - 2969

Easy Task

Time Limit: 2 Seconds 
Memory Limit: 65536 KB 

Calculating the derivation of a poly]]></description><category></category></item><item><title><![CDATA[ZOJ 2970 Faster, Higher, Stronger]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7983400</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7983400</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 23:23:19 +0800</pubDate><description><![CDATA[题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2970

Faster, Higher, Stronger

Time Limit: 2 Seconds 
Memory Limit: 65536 KB 


In the year 2008, the 29th Olympic Games will]]></description><category></category></item><item><title><![CDATA[线段树专题：poj 2464 Brownie Points II]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7983226</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7983226</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 22:02:35 +0800</pubDate><description><![CDATA[非常金典的线段树题目~~~
#include
#include
#include
#define ls rt<<1
#define rs rt<<1|1
#define lson l,m,ls
#define rson m+1,r,rs
#define sf scanf 
#define pf printf
using namespace std;
//非常经典的线段树题目，]]></description><category></category></item><item><title><![CDATA[E - Easy Task 解题报告]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7982625</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7982625</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 17:21:19 +0800</pubDate><description><![CDATA[水题，看懂题意可以，求求导后的每一项的系数
#include 
int a[1000];
int main()
{
	int cas,n,i;
	scanf("%d",&cas);
	while(cas--)
	{
		scanf("%d",&n);
		for(i=n;i>=0;i--)
		{
			scanf("%d",&a[i]);
		}
		for(i=n;i>=1;i--)
		{]]></description><category></category></item><item><title><![CDATA[L - Light Bulbs 解题报告 (隐藏水题)]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7982619</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7982619</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 17:19:30 +0800</pubDate><description><![CDATA[隐藏的大水题啊！！  the grid points.！！

在网格点上面找。。坑爹。。模拟退火了好久

直接枚举就好了

#include 
#include 
#include 
#include 
using namespace std;
struct deng
{
	double x,y,z,i;
};deng d[105];
double dis(int k,int b,in]]></description><category></category></item><item><title><![CDATA[C - Colorful Rainbows 解题报告 (双向栈)]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7982604</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7982604</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 17:18:30 +0800</pubDate><description><![CDATA[先将所给直线按b值排序，b值小的直线若想最后在上面，就必须比当前最小的斜率小，或者比最大的斜率大
所以最小斜率和最大斜率弄2个栈，我是弄一个数组，把起点放在中间
如果斜率满足，就看他是否覆盖了之前的线，类似于凸包中的退栈方法
#include 
#include 
#include 
#include 
using namespace std;
struct deng
{
	double x]]></description><category></category></item><item><title><![CDATA[G - Give Me the Number 解题报告]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7982535</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7982535</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 16:50:03 +0800</pubDate><description><![CDATA[G题，就是以前做过的字符串专题的差不多的题啊，就是多了个 “and ” 遇到 continue 即可。。。
 
#include
#include
char text[35][20]={"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten",// 0 ~ 10
 "elev]]></description><category></category></item><item><title><![CDATA[J - Just Pour the Water 解题报告]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7982529</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7982529</guid><author>CSUST_ACM</author><pubDate>Sat, 15 Sep 2012 16:45:33 +0800</pubDate><description><![CDATA[本次比赛隐藏水题之一。。。
估计这题看到 M 10^9 就跪了一半了吧。。。
可是每个操作都是重复的，最多循环到一个程度，值就不会变了，所以用 a[], d[] 两个数组记录前后的两个状态，如果状态不在改变即可 break 了。。。
#include
#include
#define esp 1e-5  
#define sf scanf
double a[25],c[25],d[2]]></description><category></category></item><item><title><![CDATA[Hdu 1166 敌兵布阵 （树状数组版）]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7980448</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7980448</guid><author>CSUST_ACM</author><pubDate>Fri, 14 Sep 2012 19:42:05 +0800</pubDate><description><![CDATA[复习下树状数组：
#include
#include
#define sf scanf
#define pf printf 
//my 171ms AC
//显然这道题目用树状数组比线段树简单的多，所以再写个树状数组复习下。 
const int N=50000+10;
int a[N],sum[N];

void add(int i,int j){
     while(i]]></description><category></category></item><item><title><![CDATA[HDU 1018 Big Number数论（解题报告）]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7980383</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7980383</guid><author>CSUST_ACM</author><pubDate>Fri, 14 Sep 2012 19:13:19 +0800</pubDate><description><![CDATA[Problem Description

In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ar]]></description><category></category></item><item><title><![CDATA[线段树专题：hdu 1166敌兵布阵]]></title><link>https://blog.csdn.net/CSUST_ACM/article/details/7980255</link><guid>https://blog.csdn.net/CSUST_ACM/article/details/7980255</guid><author>CSUST_ACM</author><pubDate>Fri, 14 Sep 2012 18:16:38 +0800</pubDate><description><![CDATA[线段树基础入门题，裸线段树什么的不解释。
 
//my 187ms AC
//第一道自己A过去的线段树~ 
#include
#include
#include
#define ls rt<<1
#define rs rt<<1|1
#define lson l,m,ls
#define rson m+1,r,rs
#define sf scanf 
#define pf]]></description><category></category></item></channel></rss>