__小明003的博客

LCP Array Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1223    Accepted Submission(s): 338 Problem Description Peter has a

String Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 939    Accepted Submission(s): 305 Problem Description There is a string

Matrix Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 768    Accepted Submission(s): 323 Problem Description There is a matr

Machine Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 442    Accepted Submission(s): 263 Problem Description There is a machi

xiaoxin juju needs help Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1149    Accepted Submission(s): 329 Problem Description

Tr A Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4088    Accepted Submission(s): 3050 Problem Description A为一个方阵，则Tr A表示A的迹

题目：http://hihocoder.com/problemset/problem/1270 //还是要静下心来好好想想，想通了再写。。。 乱交一点意义都没有 //还是学长说的对："提交简单，AC不易，且敲且叹息”。。。 //这题是个完全背包不过稍有变形 完全背包求得是给你一个背包V问装满V可以取得最大值，此题是取得最小值。 //不过需要注意题目要求可以溢出 就是物品的容量即使大于V也可

题目：http://hihocoder.com/problemset/problem/1269 //主要就是二分查找 以q 为界限 #include using namespace std; long long n,m; int a[100005]; priority_queueq; long long Find(int len) { while(!q.empty())

CA Loves GCD Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1212    Accepted Submission(s): 397 Problem Description CA is a

饭卡 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 19702    Accepted Submission(s): 6867 Problem Description 电子科大本部食堂的饭卡有一种很诡异的

最长回文 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13839    Accepted Submission(s): 5039 Problem Description 给出一个只由小写英文字符a,b,

Jam's balance Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 733    Accepted Submission(s): 351 Problem Description Jim has a bala

http://acm.hdu.edu.cn/diy/contest_show.php?cid=28827 1001： 排序求解 #include #include #include #include #include using namespace std; double ff(double x1,double y1,double x2,double y2) { retur

matrix Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 450    Accepted Submission(s): 270 Problem Description Given a matrix wi

sequence1 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 292    Accepted Submission(s): 218 Problem Description Given an array

GTW likes gt Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 316    Accepted Submission(s): 111 Problem Description Long long

GTW likes math Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 125    Accepted Submission(s): 76 Problem Description After

Reorder the Books Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 449    Accepted Submission(s): 294 Problem Description dxy

Matrix Power Series Time Limit: 3000MS   Memory Limit: 131072K Total Submissions: 19323   Accepted: 8152 Description Given a n × n matrix A and a positive integer k, fi

Shortest Path Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1178    Accepted Submission(s): 369 Problem Description There i

In Touch Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1609    Accepted Submission(s): 435 Problem Description There are n soda

链接：http://codeforces.com/problemset/problem/437/D     两个集合A,B的个数分别n,m，当着两个集合通过f(a,b)连通时f(a,b)是最小的边，题目结果为n*m*f(a,b)*2  所以可以将边从大到小排序之后，用并查集维护并计算个数 #include using namespace std; #define ll long lo

链接：http://codeforces.com/problemset/problem/689/D #include using namespace std; #define ll long long const int maxn=2e5+10; struct tree { int l,r; int a,b,ma,mi; }tree[3*maxn]; int a[max

链接：http://codeforces.com/problemset/problem/102/A #include using namespace std; int a[105],ma[105][105]; int main() { int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) sca

链接：http://codeforces.com/problemset/problem/337/D   找到已经被攻击的最远距离的两个点，再遍历其他点到这两点之间的距离，当两点之间的距离都小于d，这符合题意   #include using namespace std; const int maxn=1e5+5; int n,m,d; int a[maxn],dist1[maxn],dist

链接：http://codeforces.com/problemset/problem/433/C             思路：可以先计算总的消耗，接着计算将某一类型的所有数字更换成相邻的数字之后所降低消耗的最大值。。 可以枚举每一个数换成相邻的数字之后减低的消耗，正常枚举肯定会超时。所以需要我们先求出每一个相邻数字的前缀和，接着枚举一个可以用o(1)的时间算出降低的消耗，具体看代码 #

A. Plant time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Dwarfs have planted a very interesting plant, whic

Largest Point Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 973    Accepted Submission(s): 386 Problem Description Given the

Fibonacci Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 12213   Accepted: 8668 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn

How many ways?? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2353    Accepted Submission(s): 891 Problem Description 春天到了, H

The Fewest Coins Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 6030   Accepted: 1807 Description Farmer John has gone to town to buy some farm supplies. Be

Coins Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 33224   Accepted: 11279 Description People in Silverland use coins.They have coins of value A1,A2,A3...

Dividing Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 66477   Accepted: 17291 Description Marsha and Bill own a collection of marbles. They want to split

Euro Efficiency Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3712   Accepted: 1582 Description On January 1st 2002, The Netherlands, and several other Eur

Charm Bracelet Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 31347   Accepted: 13942 Description Bessie has gone to the mall's jewelry store and spies a ch

FATE Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11009    Accepted Submission(s): 5191 Problem Description 最近xhd正在玩一款叫做FATE

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28091    Accepted Submission(s): 12529 Problem Descript

MZL's xor Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 546    Accepted Submission(s): 365 Problem Description MZL loves xor very muc

MZL's simple problem Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 931    Accepted Submission(s): 436 Problem Description A simple pr

链接：http://hihocoder.com/problemset/problem/1223 #include #include #include #include #include using namespace std; char s[1010][100]; int a[100]; int main() { int n; while(~scanf("%d