乐着过一辈子的专栏

#include#include#include#include#define Min -100000000int N, M, brand;int va[11][10010];struct shoe{ int br, pay, value;}B[110];int max(int x, int y){ return x>y?x:y;

悼念512汶川大地震遇难同胞——珍惜现在，感恩生活Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15615    Accepted Submission(s): 6618Problem Description急！灾

Bone Collector IITime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2435    Accepted Submission(s): 1278Problem DescriptionThe title of

/*Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5006 Accepted Submission(s): 2358Problem DescriptionIt is well known

/*一卡通大冒险 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Font: Times New Roman | Verdana | Georgia Font Size: ←

/*逃离迷宫 Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Font: Times New Roman | Verdana | Georgia Font Size: ← →

/*Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12661 Accepted Submission(s): 6409Problem DescriptionBefore ACM can do anyt

/*Happy Matt FriendsTime Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 970 Accepted Submission(s): 390Problem DescriptionMatt has N frie

/*CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9140 Accepted Submission(s): 3671Problem DescriptionWhuacmers use coins.They have

/*How to TypeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4656 Accepted Submission(s): 2108Problem DescriptionPirates have finished d

Human Gene FunctionsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2757    Accepted Submission(s): 1558Problem DescriptionIt is

/*DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21856 Accepted Submission(s): 6168Problem DescriptionMarsha and Bill own a co

/*DescriptionDima, Inna and Seryozha have gathered in a room. That's right, someone's got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.Dima and Seryoz

/*Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 142622 Accepted Submission(s): 33185Problem DescriptionGiven a sequence

问题描述如果一个自然数N的K进制表示中任意的相邻的两位都不是相邻的数字，那么我们就说这个数是K好数。求L位K进制数中K好数的数目。例如K = 4，L = 2的时候，所有K好数为11、13、20、22、30、31、33 共7个。由于这个数目很大，请你输出它对1000000007取模后的值。输入格式输入包含两个正整数，K和L。输出格式输出一个整数，表示答案对1000

Starship TroopersTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12119    Accepted Submission(s): 3340Problem DescriptionYou, the leader of Sta

/*Clickomania Time Limit : 20000/10000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Font: Times New Roman | Verdana | Georgia Font S

/*How many ways Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 2Font: Times New Roman | Verdana | Georgia Font S

/*命运 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 1Font: Times New Roman | Verdana | Georgia Font Size: ← →Pr

/*FatMouse's Speed Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Special Judge Font: Times New Roman | Verdana

/*FATE Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 1Font: Times New Roman | Verdana | Georgia Font Size: ← →

/*龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11477 Accepted Submission(s): 4318Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打击——

/*To The MaxTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8201 Accepted Submission(s): 3985Problem DescriptionGiven a two-dimen

题目意思就是给出一串数字， 求出最大序列和， 序列要求前一个必须

/*Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5910 Accepted Submission(s): 2502Problem DescriptionIgnatius has just co

/*I NEED A OFFER! Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 5Font: Times New Roman | Verdana | Georgia Font

RobberiesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12908    Accepted Submission(s): 4774Problem DescriptionThe aspiring Roy th

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31842    Accepted Submission(s): 13104Problem DescriptionMany years ag

/*Advanced Fruits Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 5Special Judge Problem DescriptionThe company

/*Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18902 Accepted Submission(s): 6217Problem DescriptionNow I think you

/*PearlsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1704 Accepted Submission(s): 782Problem DescriptionIn Pearlania everybody is fo

/*最大子矩阵Time Limit: 30000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3280 Accepted Submission(s): 1652Problem Description给你一个m×n的整数矩阵，在上面找一个x×y的子矩阵

/*毕业bg Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Font: Times New Roman | Verdana | Georgia Font Size: ← →

/*ACboy needs your help Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Font: Times New Roman | Verdana | Georgia

问题描述有一棵 n 个节点的树，树上每个节点都有一个正整数权值。如果一个点被选择了，那么在树上和它相邻的点都不能被选择。求选出的点的权值和最大是多少？输入格式第一行包含一个整数 n 。接下来的一行包含 n 个正整数，第 i 个正整数代表点 i 的权值。接下来一共 n-1 行，每行描述树上的一条边。输出格式输出一个整数，代表选出的点的权值和的最大值。