其他

Non-negative Partial SumsTime Limit : 6000/3000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 1Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionYou are given a

Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 7802 Accepted: 3710DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year was

Max Sum of Max-K-sub-sequenceTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 4Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionGiven a circle

poj 2492因為只有兩種關係，所以val代碼的與根節點的距離可以來模2對於根節點的更新，在題目的描述中加上自己的理解可以得出代碼如下：#include<iostream>using namespace std;#include<cstdio>const int maxn=100010;int pre[maxn],val[maxn];int find(int x){ if(pre[x]==x) return x; int t=pre[x];

More is betterTime Limit : 5000/1000ms (Java/Other)   Memory Limit : 327680/102400K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 6Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionMr Wang wants some boys to

BillboardTime Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4097    Accepted Submission(s): 1907Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size

B.直接一天天加上去。#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <vector>#include <cmath>#define LL long longusing namespace std;int fromy,fromm,fromd,toy,tom,tod;int month[13]={0,31,28

A Simple Problem with IntegersTime Limit : 10000/5000ms (Java/Other)   Memory Limit : 262144/131072K (Java/Other)Total Submission(s) : 40   Accepted Submission(s) : 13Problem DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with

SupermarketTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7838 Accepted: 3334DescriptionA 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

   一直都沒來得及完成關於演算法課上的實驗任務，今天終於算是有時間把這個給寫了。#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<iostream>using namespace std;//蠻力法int maxSum(int a[],int n){ int maxsum=0; int sum=0; for(int i=

After the last war devastated your country, you - as the king of the land of Ardenia - decided it was high time to improve the defense of your capital city. A part of your fortification is a line of mage towers, starting near the city and continuing

Red and BlackTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4527    Accepted Submission(s): 2945Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored

B. Painting Eggstime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Bitlandians are quite weird people. They have very peculiar customs.As is customary, Uncle J. wants to have n eggs painted for

FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2760    Accepted Submission(s): 1064Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered

這是一道關於二叉樹的題，具體的題目是杭電的1710 ，就是通過二叉樹的前序和後序來推出二叉樹的中序序列，一道很簡單的題，不過筆者還是太笨了，花了好久才搞定。具體的思想就是先通過一個前序序列找到它的根節點，在通過找到根節點在中序序列裡的位置來得出，該位置前的全為左子樹的結點，後面的全為右子樹的結點，在通過層層遞迴得出。代碼如下：#include<stdio.h>#include<string.h>#include<iostream>using

Stock ExchangeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2579 Accepted: 935DescriptionThe world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very

hdu 3172並查集，大水題直接代碼：#include<iostream>using namespace std;#include<cstdio>#include<map>const int maxn=100005;int pre[maxn],val[maxn];map<string,int> m;inline int input(){ char c; int ret=0; c=getchar(); while(c<

Just a HookTime Limit : 4000/2000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 12   Accepted Submission(s) : 5Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of

D. Greg and Graphtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGreg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them

LCISTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1713    Accepted Submission(s): 748Problem DescriptionGiven n integers.You have two operations:U A B: replace the Ath number by B. (index