![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
阿文施瓦辛格
这个作者很懒,什么都没留下…
展开
-
E. Ultra-QuickSort
E. Ultra-QuickSortTime Limit: 7000msCase Time Limit: 7000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 2418Font Size: + -In this problem, you have原创 2014-05-19 19:45:48 · 444 阅读 · 0 评论 -
杭电1242 rescue
E - RescueCrawling failedSubmit Status Practice POJ 3278DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to sa原创 2015-05-06 18:33:46 · 431 阅读 · 0 评论 -
杭电1312 red and black
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8694 Accepted Submission(s): 5393Problem DescriptionThere is a rectangular room,原创 2015-05-06 18:33:38 · 355 阅读 · 0 评论 -
B Stars
B. StarsTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 2471Font Size: + -Astronomers often examine star maps原创 2014-05-19 19:46:02 · 417 阅读 · 0 评论 -
C mobile phones
C. Mobile phonesTime Limit: 5000msCase Time Limit: 5000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit StatusFont Size: + -Suppose that the fourth generation mob原创 2014-05-19 19:45:55 · 352 阅读 · 0 评论 -
hdu 1253 胜利大逃亡
胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24170 Accepted Submission(s): 9249Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatiu原创 2015-05-06 18:33:49 · 368 阅读 · 0 评论 -
poj3278 catch that cow
Catch That CowTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 43653Accepted: 13605DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately原创 2015-05-06 18:33:42 · 352 阅读 · 0 评论 -
POJ3468 A simple problem with integers(区间更新)
A Simple Problem with IntegersTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 55949Accepted: 16877Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to deal wi原创 2014-05-19 19:46:07 · 380 阅读 · 0 评论 -
杭电1867 A + B for you again
Hot~ 2014暑期多校联合训练——正式启动报名~ 详见“杭电ACM”微博~A + B for you againTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3811 Accepted Submission(s): 970Pro原创 2014-05-19 19:46:13 · 443 阅读 · 0 评论 -
hdu1863(prim)
畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15661 Accepted Submission(s): 6498Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一原创 2015-05-06 18:34:00 · 471 阅读 · 0 评论 -
hdu1102 constructing road
Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13106 Accepted Submission(s): 4954Problem DescriptionThere are N villages,原创 2015-05-06 18:33:57 · 380 阅读 · 0 评论 -
F,Japan
#include#include#includeusing namespace std;typedef struct node{ int x; int y;}as;as a[1000001];int c[1003];int n,m,k;bool cmp(node aa,node bb){ if(aa.x==bb.x) return aa.y return aa.x}int lowbit(int原创 2014-05-19 19:45:57 · 422 阅读 · 0 评论 -
杭电1711 Number Sequence
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10002 Accepted Submission(s): 4561Problem DescriptionGiven two sequences of n原创 2014-05-19 19:46:09 · 369 阅读 · 0 评论 -
杭电1863+1879
畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15579 Accepted Submission(s): 6469Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一原创 2015-05-06 18:33:53 · 325 阅读 · 0 评论 -
理解 约瑟夫环
总结了个小经验,有时候光靠看是看不出什么端倪来的,还必须得动下笔,比划比划也许就那么简单#include #include typedef struct Node{ int data; struct Node *next;}Node; Node *CreatList(int n) //创建一个含n个人的循环链表{int i;Node *head,*p,*q;head=(Node*)mallo原创 2014-05-19 19:45:39 · 430 阅读 · 0 评论 -
A 敌兵布阵
A. 敌兵布阵Time Limit: 1000msCase Time Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 5379Font Size: + -C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他原创 2014-05-19 19:45:50 · 503 阅读 · 0 评论 -
2828Buy ticket
算是自己写的线段树吧,当然也参考了别人的代码,一次ac,小小的成就感Buy TicketsTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 11957Accepted: 5886DescriptionRailway tickets were difficult to buy around the Lunar New Year in C原创 2014-05-19 19:46:04 · 604 阅读 · 0 评论 -
杭电1241 oil deposit
Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11002 Accepted Submission(s): 6410Problem DescriptionThe GeoSurvComp geologic sur原创 2015-05-06 18:33:34 · 360 阅读 · 0 评论 -
杭电1010
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 65276 Accepted Submission(s): 17822Problem DescriptionThe doggie found a b原创 2015-05-06 18:33:30 · 517 阅读 · 0 评论 -
G Iversions
G. InversionsTime Limit: 500msCase Time Limit: 500msMemory Limit: 4096KB64-bit integer IO format: %I64d Java class name: SolutionSubmit Status PID: 10387Font Size: + -There are N integers (1A[j].原创 2014-05-19 19:45:53 · 325 阅读 · 0 评论 -
杭电2087 剪花布条
跟1711一样的kmp入门题目#include#includechar s[1111],t[1111];int next[1111],len1,len2;void getnext(){ int i=1,j=0; next[1]=0; while(i { if(j==0||t[i]==t[j]) { i++; j++; next[i]=j; } else j=next[j];}原创 2014-05-19 19:46:11 · 378 阅读 · 0 评论 -
D Cows
#include#include#includeusing namespace std;typedef struct node { int w; int x; int y;}node;node a[100001];int c[100001];int n;bool cmp(node a,node b){ if(a.y==b.y) return a.x return a.y>b.y;}int lowb原创 2014-05-19 19:46:00 · 359 阅读 · 0 评论 -
杭电1280 前m大的数(哈希表)
前m大的数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9557 Accepted Submission(s): 3350Problem Description还记得Gardon给小希布置的那个作业么?(上次比赛的1005)其实小希原创 2014-05-19 19:46:18 · 534 阅读 · 0 评论