摘要: class MyThread implements Runnable { public void run() { for(int i=0; i10) { try { t.join(); } catch (Exception e) { } } System.out.println("Main... 阅读全文
posted @ 2014-10-16 19:48 awenzero 阅读(236) 评论(0) 推荐(0) 编辑
摘要: 在Java实现多线程的程序中,虽然Thread类实现了Runnable接口,但是操作线程的主要方法并不在Runnable接口中,而是在其子类Thread中,比如start()这个方法就只能通过Thread实例化才能使用,用Runnable的话则会出错 正如以下这个程序: class MyTh... 阅读全文
posted @ 2014-10-16 19:02 awenzero 阅读(103) 评论(0) 推荐(0) 编辑
摘要: 前m大的数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9557 Accepted Submission(s): 3350Prob... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(129) 评论(0) 推荐(0) 编辑
摘要: Hot~ 2014暑期多校联合训练——正式启动报名~ 详见“杭电ACM”微博~A + B for you againTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Su... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(78) 评论(0) 推荐(0) 编辑
摘要: 跟1711一样的kmp入门题目#include#includechar s[1111],t[1111];int next[1111],len1,len2;void getnext(){ int i=1,j=0; next[1]=0; while(ilen2) { sum++; j=1; ... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(94) 评论(0) 推荐(0) 编辑
摘要: Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10002 Accepted Submission(... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(127) 评论(0) 推荐(0) 编辑
摘要: A Simple Problem with IntegersTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 55949Accepted: 16877Case Time Limit: 2000MSDescriptionYou hav... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(126) 评论(0) 推荐(0) 编辑
摘要: 算是自己写的线段树吧,当然也参考了别人的代码,一次ac,小小的成就感Buy TicketsTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 11957Accepted: 5886DescriptionRailway tickets w... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(83) 评论(0) 推荐(0) 编辑
摘要: B. StarsTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 247... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(122) 评论(0) 推荐(0) 编辑
摘要: #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... 阅读全文
posted @ 2014-05-19 19:46 awenzero 阅读(141) 评论(0) 推荐(0) 编辑