C语言
文章平均质量分 91
折古
关于我:要素过多,不便透露
展开
-
数据结构——基本算法
排序直接插入排序#include <cstdio>#include <iostream>#include <malloc.h>#include <cstring>using namespace std;int a[1000];void insert_sort(int n){ int i,j; for(i=1;i<n;i++){ if(a[i]<a[i-1]){//前i-1已经排好序了 --只需要对比跟前一位的大小即可原创 2020-08-06 12:36:33 · 449 阅读 · 0 评论 -
HDU 1698 Just a Hook【线段树—区间更新】
Just a Hook Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Other...原创 2019-10-17 09:22:57 · 195 阅读 · 0 评论 -
HDU 1698 Just a Hook【线段树—区间更新】
Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 30587 Accepted Submission(s): 15087原创 2017-03-23 17:51:35 · 197 阅读 · 0 评论 -
hdu 4027 Can you answer these queries?
Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 15334 Accepted Submission(s): 3595Problem Description A原创 2017-03-24 21:31:27 · 278 阅读 · 0 评论 -
hdu-2089 不要62【数位dp】
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 41386 Accepted Submission(s): 15086Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:lao原创 2017-04-20 14:58:23 · 344 阅读 · 0 评论 -
在DP中使用滚动数组
转自:http://www.java3z.com/cwbwebhome/article/article19/res071.html?id=3963举个简单的例子:int d[]=new int[100];d[0]=1;d[1]=1;for(int i=2;i d[i]=d[i-1]+d[i-2];System.out.printf("%d",d[99]);转载 2017-04-21 17:13:42 · 363 阅读 · 0 评论 -
poj-1651 Multiplication Puzzle(区间dp入门)
Multiplication Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9957 Accepted: 6152Description The multiplication puzzle is played with a row of cards, each containing a si原创 2017-04-25 16:17:20 · 305 阅读 · 0 评论 -
hdu-3632 A Captivating Match(区间dp)
hdu-3632 A Captivating Match转载 2017-04-25 19:41:18 · 390 阅读 · 0 评论 -
hdu-4632 Palindrome subsequence
Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65535 K (Java/Others) Total Submission(s): 3181 Accepted Submission(s): 1326link Problem Description In math原创 2017-04-25 20:32:13 · 501 阅读 · 0 评论 -
poj2528Mayor's posters【离散化+线段树】
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 62773 Accepted: 18121DescriptionThe citizens of Bytetown, AB, could not stand that the cand原创 2017-03-23 16:09:20 · 267 阅读 · 0 评论 -
hdu4081 Qin Shi Huang's National Road System
Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7488 Accepted Submission(s): 2635Problem Descri原创 2017-03-29 15:18:18 · 196 阅读 · 0 评论 -
poj3468(区间更新)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 105705 Accepted: 33019Case Time Limit: 2000MSDescriptionYou have N原创 2017-03-22 16:03:53 · 225 阅读 · 0 评论 -
nyoj-586 疯牛
这道题是nyoj中比较典型的贪心+二分题型原创 2016-09-14 18:05:26 · 300 阅读 · 0 评论 -
关于八皇后问题
八皇后问题是一个经典的回溯问题,利用回溯法可以很快的求解出问题的答案原创 2016-09-20 21:11:56 · 422 阅读 · 0 评论 -
nyoj737石子合并
#include#includeint min(int a,int b){ return a>b?b:a;}int dp[203][203],sum[203]; int main(){ int n; while(~scanf("%d",&n)) { int s[203]; int i,j,start,end,mid; sum[0原创 2016-09-27 19:08:03 · 318 阅读 · 0 评论 -
表达式求值
描述 假设表达式定义为:1. 一个十进制的正整数 X 是一个表达式。2. 如果 X 和 Y 是 表达式,则 X+Y, X*Y 也是表达式; *优先级高于+.3. 如果 X 和 Y 是 表达式,则 函数 Smax(X,Y)也是表达式,其值为:先分别求出 X ,Y值的各位数字之和,再从中选最大数。4.如果 X 是 表达式,则 (X)也是表达式。例如:表达式 12*(2+3)+Smax(333,220+原创 2017-03-18 10:00:46 · 369 阅读 · 0 评论 -
c语言中的按位与,与或,异或;
按位与运算符:&语法expression & expression备注表达式可以是其他“与”表达式,或(遵循下面所述的类型限制)相等表达式、关系表达式、加法表达式、乘法表达式、指向成员的指针表达式、强制转换表达式、一元表达式、后缀表达式或主表达式。按位“与”运算符 (&) 会将第一操作数的每一位与第二操作数的相应位进行比较。如果两个位均为 1,则对应的结果位将设置为 1原创 2017-03-20 11:02:07 · 36164 阅读 · 0 评论 -
Prim算法和Dijkstra算法的异同
之前一直觉得Prim和Dijkstra很相似,但是没有仔细对比;今天看了下,主要有以下几点:1:Prim是计算最小生成树的算法,比如为N个村庄修路,怎么修花销最少。Dijkstra是计算最短路径的算法,比如从a村庄走到其他任意村庄的距离。2:Prim算法中有一个统计总len的变量,每次都要把到下一点的距离加到len中;Dijkstra算法中却没有,只需要把到下一点的距离原创 2017-03-07 09:15:55 · 5484 阅读 · 0 评论 -
poj 2887 块状数组
Big StringTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 7116 Accepted: 1701DescriptionYou are given a string and supposed to do some string manipul原创 2017-03-21 16:00:27 · 392 阅读 · 0 评论 -
敌兵布阵 (线段树求和)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 84978 Accepted Submission(s): 35869Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以原创 2017-03-21 17:13:43 · 580 阅读 · 1 评论 -
A Famous Music Composer
A Famous Music Composer时间限制:1000 ms | 内存限制:65535 KB难度:1描述 Mr. B is a famous music composer. One of his most famous work was his set of preludes. These 24 pieces span the 24 musical keys (t原创 2016-07-12 16:44:23 · 361 阅读 · 0 评论