2015年12月_阿阿阿黄

原创 hdu--1231

最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24650 Accepted Submission(s): 11039Problem Description给定K个整数的序列{ N1, N

2015-12-27 22:26:13 211

原创 nyoj--（基础dp）

聪明的kk时间限制：1000 ms | 内存限制：65535 KB难度：3描述聪明的“KK”非洲某国展馆的设计灵感源于富有传奇色彩的沙漠中陡然起伏的沙丘，体现出本国不断变换和绚丽多彩的自然风光与城市风貌。展馆由五部分组成，馆内影院播放名为《一眨眼的瞬间》的宽银幕短片，反映了建国以来人民生活水平和城市居住环境的惊人巨变。可移动“沙丘”变戏法的灵感源于其独

2015-12-27 21:33:34 525

原创 Fuzhou oj--2221

Problem 2221 RunningManAccept: 7 Submit: 18Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionZB loves watching RunningMan! There's a game in RunningMan called 100

2015-12-27 20:13:54 728

原创 hdu-

Bitwise EquationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 645 Accepted Submission(s): 343Problem DescriptionYou are gi

2015-12-27 18:00:40 412

原创 Fuzhou oj--福建省校赛重现

Problem C Knapsack problemAccept: 83 Submit: 457Time Limit: 3000 mSec Memory Limit : 32768 KB Problem DescriptionGiven a set of n items, each with a weight w[i] and a value v[i],

2015-12-27 17:55:34 485

原创 hdu--1011

Starship TroopersTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15065 Accepted Submission(s): 4046Problem DescriptionYou, t

2015-12-24 18:34:38 330

原创 hdu--2084

数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31139 Accepted Submission(s): 18595Problem Description在讲述DP算法的时候，一个经典的例子就是数

2015-12-24 17:34:21 274

原创 hdu--1007(分治求二维最近点对)

Quoit DesignTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41828 Accepted Submission(s): 10871Problem DescriptionHave you e

2015-12-22 12:45:20 613

原创 hdu--1009

FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58364 Accepted Submission(s): 19546Problem DescriptionFatMouse

2015-12-21 12:24:42 292

原创蛇形填数

在n*n方阵里填入1，2，..........,n*n,要求填成蛇形。例如n=4时方阵为： 10 11 12 1 9 16 13 2 8 15 14 3 7 6 5 4代码如下：#include#includeusing namespace std;#define MAN 100int a[MAN][MAN];int main()

2015-12-21 11:40:47 365

原创 poj--2229

SumsetsTime Limit: 2000MS Memory Limit: 200000KTotal Submissions: 15048 Accepted: 6000DescriptionFarmer John commanded his cows to search for different sets of nu

2015-12-21 10:36:52 302

原创 hdu--2138

How many prime numbersTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14698 Accepted Submission(s): 5098Problem Description

2015-12-21 10:02:42 321

原创 floyed(记录路径)

用领接矩阵写的记录路径代码,表示数据结构好复杂,链表什么的,指针什么的,得有耐性和细心.代码如下:#include#define INF 0x3f3f3f3f#define MAXN 100int d[MAXN][MAXN];int path[MAXN][MAXN];typedef struct { char v[MAXN];//记录顶点信息 int edge[MAX

2015-12-17 17:37:25 457

原创欧拉输出路径--dfs模板

下面是代码,它同时适用欧拉通路和欧拉回路.但如果需要打印的是欧拉通路,在主程序中调用的参数必须是道路的起点.另外,打印的顺序是逆序的,因此真正使用这份代码时,应该把printf语句替换成一条push语句，把（u，v）压入栈中。代码如下：void euler(int u){ for(int v=0;v<n;v++){ if(G[u][v]&&!vis[u][v]){ vi

2015-12-16 20:53:12 1130

原创 poj--1041

John's tripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8015 Accepted: 2694 Special JudgeDescriptionLittle Johnny has got a new car. He decided t

2015-12-16 20:44:55 302

原创 hdu--3018

Ant TripTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2156 Accepted Submission(s): 831Problem DescriptionAnt Country consis

2015-12-16 13:05:04 429

原创 hdu--1856

More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 20410 Accepted Submission(s): 7471Problem DescriptionMr Wang

2015-12-14 22:13:04 275

原创 ZZULIOJ--1798

1798: 戴姆勒的求助Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 542 Solved: 75SubmitStatusWeb BoardDescription戴姆勒最近比较喜欢平方数，自称掌握所有关于平方数的题。灿灿听到后就不高兴了，立马要考考他。聪明的灿灿要用立方数来难倒他。他给戴姆勒一个数字n

2015-12-14 21:27:50 492

原创欧拉回路或通路路径输出(Fleury算法)

在下面的代码中,首先判断是否存在回路或通路,如果存在则选择一个正确的顶点按照Fleury算法输出欧拉回路或通路代码如下:#include#include #define MAXN 200using namespace std;int Edge[MAXN][MAXN];//邻接矩阵int n;//顶点个数 struct stack{ int top,node[M

2015-12-14 20:49:01 1100

原创 poj--2337(输出欧拉路径)

CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10681 Accepted: 2788DescriptionA catenym is a pair of words separated by a period such that the

2015-12-14 20:15:24 514

原创 Light oj--1258（KMP的变形）

DescriptionA string is said to be a palindrome if it remains same when read backwards. So, 'abba', 'madam' both are palindromes, but 'adam' is not.Now you are given a non-empty string S, contain

2015-12-11 21:33:20 495

原创 poj--1386

Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10995 Accepted: 3754DescriptionSome of the secret doors contain a very interesting word puz

2015-12-10 22:34:57 281

原创 poj--1300

Door ManTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2530 Accepted: 1020DescriptionYou are a butler in a large mansion. This mansion has so many room

2015-12-10 21:21:29 292

原创 zzulioj--1816

1816: 矩形Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 101 Solved: 30SubmitStatusWeb BoardDescription小S和小D两个小雪参，在玩一个关于矩形的游戏以帮助他们学会怎么计算矩形的面积然后完成作业去打游戏（两个小雪参一起打游戏你怕不怕！）。他们约定每个人给出两个坐标，分别

2015-12-10 20:24:38 573

原创 hpu--1721（离散化）

1721: 感恩节KK专场——雪人的高度时间限制: 1 Sec 内存限制: 128 MB提交: 88 解决: 39[提交][状态][讨论版]题目描述大雪过后，KK决定在春秋大道的某些区间上堆雪人。现在KK遇到了一道统计雪人高度的难题，请你帮帮他吧。注：KK堆雪人前春秋大道上是没有雪人的即所有位置雪人高度为0。输入给定一个整数t，表示有t(

2015-12-10 19:29:51 304

原创 ZZULI Oj--1819

1819: 加加加！（油）Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 57 Solved: 35SubmitStatusWeb BoardDescription实验室的小D同学又开始玩游戏了，这次他的游戏貌似很高级的样子。首先他在一张纸上写下了一个数n,然后他在两个无差别的球上写上两个数分别是a和b，他把两个球放在

2015-12-08 17:26:17 515

原创 ZZULI Oj--1817

1817: match numberTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 75 Solved: 35SubmitStatusWeb BoardDescription喜欢写程序的同学一般对数字较为敏感。对于一串长度为2*n的号码，我们认为如果它符合以下条件，就是匹配的：把这个号码分为左右两半部分，长度均为n

2015-12-08 17:13:57 664

原创 CodeForces 7C(扩展欧几里德解方程)

DescriptionA line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from - 5·1018 to 5·1018 inclusive, or t

2015-12-08 13:19:28 596

原创 Light oj--1100

DescriptionGiven an array with n integers, and you are given two indices i and j (i ≠ j) in the array. You have to find two integers in the range whose difference is minimum. You have to print thi

2015-12-07 22:05:48 368

原创 FZU--2188(BFS+多条件判断,这题超好)

Description一天，小明需要把x只羊和y只狼运输到河对面。船可以容纳n只动物和小明。每次小明划船时，都必须至少有一只动物来陪他，不然他会感到厌倦，不安。不论是船上还是岸上，狼的数量如果超过羊，狼就会把羊吃掉。小明需要把所有动物送到对面，且没有羊被吃掉，最少需要多少次他才可以穿过这条河？Input有多组数据，每组第一行输入3个整数想x, y, n (0≤ x,

2015-12-07 11:12:25 377

原创 hdu--1034

Candy Sharing GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4444 Accepted Submission(s): 2714Problem DescriptionA numbe

2015-12-07 10:04:16 233

原创 hdu--5311

Hidden StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1705 Accepted Submission(s): 600Problem DescriptionToday is th

2015-12-07 09:29:43 389

原创 hdu--5533

Dancing Stars on MeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 592 Accepted Submission(s): 315Problem DescriptionThe sk

2015-12-06 19:32:12 335

原创 Light oj--1148

DescriptionMob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population of the town. Now the naive approach to this problem will be counting people one by o

2015-12-06 12:39:50 437

原创 hdu--5499

SDOITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 701 Accepted Submission(s): 275Problem DescriptionThe Annual National O

2015-12-04 18:14:46 367

原创 Light oj--1275(二次函数)

DescriptionA group of N Internet Service Provider companies (ISPs) use a private communication channel that has a maximum capacity of C traffic units per second. Each company transfers T traffic u

2015-12-03 21:17:09 314

原创 Light oj--1214(大数整除)

DescriptionGiven two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such

2015-12-03 17:38:21 354

原创 Light oj--1116

DescriptionEkka and his friend Dokka decided to buy a cake. They both love cakes and that's why they want to share the cake after buying it. As the name suggested that Ekka is very fond of odd num

2015-12-03 17:17:33 291

原创 Light--1078(取模运算)

DescriptionIf an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you

2015-12-03 16:34:53 280

原创 Light oj--1008

DescriptionFibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.Among these gifts th

2015-12-02 20:08:49 385

wampserver2.5

超级简单的商城网站设计

腾讯软件中心--简单的首页界面设计

空空如也