<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[agilely的专栏]]></title><description><![CDATA[人事を尽くして天命を待つ ]]></description><link>https://blog.youkuaiyun.com/agilely</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; agilely]]></copyright><item><title><![CDATA[搬家了]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/5490691</link><guid>https://blog.youkuaiyun.com/agilely/article/details/5490691</guid><author>agilely</author><pubDate>Thu, 15 Apr 2010 21:51:00 +0800</pubDate><description><![CDATA[实验室的网速比较卡搬家到http://www.cnblogs.com/here继续学习  恩。。。]]></description><category></category></item><item><title><![CDATA[1010 迷宫问题]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/5002952</link><guid>https://blog.youkuaiyun.com/agilely/article/details/5002952</guid><author>agilely</author><pubDate>Mon, 14 Dec 2009 11:25:00 +0800</pubDate><description><![CDATA[Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He re]]></description><category></category></item><item><title><![CDATA[1009  贪心]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/5000350</link><guid>https://blog.youkuaiyun.com/agilely/article/details/5000350</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 23:09:00 +0800</pubDate><description><![CDATA[Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contain]]></description><category></category></item><item><title><![CDATA[1008]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4999764</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4999764</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 21:38:00 +0800</pubDate><description><![CDATA[Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified ]]></description><category></category></item><item><title><![CDATA[★1007 给定一些点求两点之间的最短距离]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4998166</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4998166</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 16:05:00 +0800</pubDate><description><![CDATA[ Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the pos]]></description><category></category></item><item><title><![CDATA[1004]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4998137</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4998137</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 15:57:00 +0800</pubDate><description><![CDATA[Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges favorite time is guessing the most popular problem. When the contest i]]></description><category></category></item><item><title><![CDATA[1003 局部最值问题]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4998084</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4998084</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 15:46:00 +0800</pubDate><description><![CDATA[Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +]]></description><category></category></item><item><title><![CDATA[1002]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4998038</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4998038</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 15:36:00 +0800</pubDate><description><![CDATA[ 大数相加   #include using namespace std;int main(){    char a[1000],b[1000],c[1000];    int n,Case = 1;    cin>>n;    while(n--)    {        cin>>a>>b;        int i = strlen(a);]]></description><category></category></item><item><title><![CDATA[1248]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4997413</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4997413</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 12:55:00 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1248   #includeusing namespace std;int flag[]={150,200,350};bool avi[10001]={false};int main(){	int t,n,i,j,k;	for(i=0;i<10001;i+=flag[0])]]></description><category></category></item><item><title><![CDATA[1050]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4997332</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4997332</guid><author>agilely</author><pubDate>Sun, 13 Dec 2009 12:42:00 +0800</pubDate><description><![CDATA[ http://acm.hdu.edu.cn/showproblem.php?pid=1050 //维护一张表P[]，其值最大的数即为所需的时间数#includeint main(){	int i,j,t,N,P[200],k,s,d,temp,min;	scanf("%d",&t);	for(i=0;i<t;i++)	{		for(j=0;j<200;j+]]></description><category></category></item><item><title><![CDATA[语义网格学习报告]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4974933</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4974933</guid><author>agilely</author><pubDate>Wed, 09 Dec 2009 23:13:00 +0800</pubDate><description><![CDATA[网格是一种信息社会的网络基础设施，是利用互联网把分散在不同地理位置上的多个资源，包括计算资源、存储资源、通信资源、软件资源、信息资源、知识资源等全面连通和统一分配、管理及协调起来，通过逻辑关系组成一台“虚拟的超级计算机”。这台机器把每一台参与其中的、包括个人电脑在内的计算机都作为自己的一个“节点”，成千上万个这样的“节点”并联起来，就组成了“一张有超级计算能力的网格”。而每一位将自己的计算机连接到]]></description><category></category></item><item><title><![CDATA[Linux集群-软件体系结构小探]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/4974839</link><guid>https://blog.youkuaiyun.com/agilely/article/details/4974839</guid><author>agilely</author><pubDate>Wed, 09 Dec 2009 22:54:00 +0800</pubDate><description><![CDATA[在本文中，笔者以IBM eServer Cluster 1300为例介绍了Beowulf集群中硬件和网络体系结构和组成部分。1 Beowulf集群软件结构一般来说，Beowulf集群由如下几个软件部分组成： 　　操作系统：勿容置疑，操作系统是任何计算机系统的软件基础。相对于桌面系统而言，集群系统对操作系统的任务调度和文件管理方面的要求更高。 　　并行开发库：只要是指用于集群中进程通信的软件]]></description><category></category></item><item><title><![CDATA[first original essay]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/83436252</link><guid>https://blog.youkuaiyun.com/agilely/article/details/83436252</guid><author>agilely</author><pubDate>Sat, 01 Aug 2009 10:35:16 +0800</pubDate><description><![CDATA[   As for the bad net  environment here inthe lab . I cannot publish on 优快云 . ok , i'll write here ,It's my first essay in javaeye.]]></description><category></category></item><item><title><![CDATA[【转】MyEclipse快捷键]]></title><link>https://blog.youkuaiyun.com/agilely/article/details/83436250</link><guid>https://blog.youkuaiyun.com/agilely/article/details/83436250</guid><author>agilely</author><pubDate>Sat, 01 Aug 2009 10:22:13 +0800</pubDate><description><![CDATA[存盘 Ctrl+s(肯定知道) 
注释代码 Ctrl+/ 
取消注释 Ctrl+\(Eclipse3已经都合并到Ctrl+/了) 
代码辅助 Alt+/ 
快速修复 Ctrl+1 
代码格式化 Ctrl+Shift+f 
整理导入 Ctrl+Shift+o 
切换窗口 Ctrl+f6 
ctrl+shift+M 导入未引用的包 
ctrl+w 关闭单个窗口 
F3 跳转到类、变...]]></description><category></category></item></channel></rss>