算法爱好者

摘要： Flying RightTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1270Accepted: 464DescriptionFiguring that they cannot do worse than the humans have, Farmer John's cows have decided to start an airline. Being cows, they decide to cater to the heretofore-untapped market of cows as passengers. 阅读全文

摘要： Problem 1894 志愿者选拔 Accept: 753Submit: 2495Time Limit: 1500 mSecMemory Limit : 32768 KB Problem Description世博会马上就要开幕了，福州大学组织了一次志愿者选拔活动。参加志愿者选拔的同学们排队接受面试官们的面试。参加面试的同学们按照先来先面试并且先结束的原则接受面试官们的考查。面试中每个人的人品是主要考查对象之一。（提高人品的方法有扶老奶奶过街，不闯红灯等）作为主面试官的John想知道当前正在接受面试的同学队伍中人品值最高的是多少。于是他请你帮忙编写一个程序来计算。 Input输入数据第一行. 阅读全文

摘要： Wireless NetworkTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 12374Accepted: 5217DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in t 阅读全文

摘要： Sliding WindowTime Limit: 12000MSMemory Limit: 65536KTotal Submissions: 26178Accepted: 7738Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers 阅读全文

摘要： Parity gameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4587Accepted: 1799DescriptionNow and then you play the following game with your friend. Your friend writes down a sequence consisting of zeroes and ones. You choose a continuous subsequence (for example the subsequence from the thir 阅读全文

摘要： SupermarketTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6961Accepted: 2903DescriptionA supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale 阅读全文

摘要： Problem 1057 ab Accept: 815 Submit: 2639Time Limit: 1000 mSec Memory Limit : 32768 KBProblem Description对于任意两个正整数a,b（0<=a,b<10000）计算ab各位数字的和的各位数字的和的各位数字的和的各位数字的和。Input输入有多组数据，每组只有一行，包含两个正整数a,b。最后一组a=0,b=0表示输入结束，不需要处理。Output对于每组输入数据，输出ab各位数字的和的各位数字的和的各位数字的和的各位数字的和。Sample Input2 3 5 70 0Samp... 阅读全文

摘要： Problem 1924 死锁 Accept: 93Submit: 244Time Limit: 1000 mSecMemory Limit : 32768 KB Problem Description在操作系统中存在着死锁问题。 进程在执行过程中，因争夺资源而造成的一种互相等待的现象，若无外力作用，它们都将无法推进下去。此时称系统处于死锁状态或系统产生了死锁，这些永远在互相等待的进程称为死锁进程。由于资源占用是互斥的，当某个进程提出申请资源后，使得有关进程在无外力协助下，永远分配不到必需的资源而无法继续运行，这就产生了死锁。 例如，如果线程A占用了资源1并等待资源2，而线程B占用了资源2并. 阅读全文

摘要： Bookshelf 2Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5109Accepted: 2350DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.FJ has N cows (1 ≤ N ≤ 20) each with so 阅读全文

摘要： - Little Elephant and Sorting Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 205BDescriptionThe Little Elephant loves sortings.He has an array a consisting of n integers. Let's number the array elements from 1 to n, then the i-th eleme 阅读全文