算法合集之用改進(jìn)算法思想解決規(guī)模維數(shù)增大問題(參考版)
2025-06-13 01:38本頁面
【正文】 Sample Input5 4PHPPPPHHPPPPPHPPPHHPSample Output6 Selection (BalkanOI 2004 Day 1 Task 2)The Interpeninsular Olympiad in Informatics is ing and the leaders of the Balkan Peninsula Team have to choose the best contestants on the Balkans. Fortunately, the leaders could choose the members of the team among N very good contestants, numbered from 1 to N (3 ≤ N ≤ 500000). In order to select the best contestants the leaders organized three petitions. Each of the N contestants took part in all three petitions and there were no two contestants with equal results on any of the petitions. We say that contestant А is better than another contestant В when А is ranked before В in all of the petitions. A contestant A is said to be excellent if no other contestant is better than A. The leaders of the Balkan Peninsula Team would like to know the number of excellent contestants.Write a program named TEAM, which for given N and the three petitions results, putes the number of excellent contestants.The input data are given on the standard input as four lines. The first line contains the number N. The next three lines show the rankings for the three petitions. Each of these lines contains the identification numbers of the contestants, separated by single spaces, in the order of their ranking from first to last place. The standard output should contain one line with a single number written on it: the number of the excellent.EXAMPLE 1Input3 2 3 13 1 21 2 3Output3Note: No contestant is better than any other contestant, hence all three are excellent.EXAMPLE 2Input 102 5 3 8 10 7 1 6 9 41 2 3 4 5 6 7 8 9 103 8 7 10 5 4 1 2 6 9Output4Note: The excellent contestants are those numbered with 1, 2, 3 and 5.2005集訓(xùn)隊(duì)論文 13 。N = 100；M = 10。)，中間沒有空格。或者39。 Input第一行包含兩個(gè)由空格分割開的正整數(shù)，分別表示N和M； 接下來的N行，每一行含有連續(xù)的M個(gè)字符(39。從圖上可見炮兵的攻擊范圍不受地形的影響。在每一格平原地形上最多可以布置一支炮兵部隊(duì)（山地上不能夠部署炮兵部隊(duì)）；一支炮兵部隊(duì)在地圖上的攻擊范圍如圖中黑色區(qū)域所示：如果在地圖中的灰色所標(biāo)識(shí)的平原上部署一支炮兵部隊(duì)，則圖中的黑色的網(wǎng)格表示它能夠攻擊到的區(qū)域：沿橫向左右各兩格，沿縱向上下各兩格。〖輸入輸出舉例〗樣例一樣例二4 51 2 3 4 56 7 8 9 1011 12 13 14 1516 17 18 19 201462 31 2 14 3 6NO（NOI2001）司令部的將軍們打算在的網(wǎng)格地圖上部署他們的炮兵部隊(duì)。2． 隊(duì)員們不想去任何地方，只需輸出NO。每兩個(gè)數(shù)之間有一個(gè)空格。其中。數(shù)據(jù)有m+1行。你的任務(wù)是編寫一個(gè)程序，求出他們的活動(dòng)范圍(m1,nl),(m2,n2)。當(dāng)然，如果某范串內(nèi)的分值總和為零的話，他們也會(huì)去玩）。GDOI隊(duì)員們希望他們活動(dòng)范圍內(nèi)的區(qū)域的分值總和最大。為了方便集合，隊(duì)員們只能在某一范圍內(nèi)活動(dòng)。GDOI隊(duì)員們預(yù)先對(duì)這個(gè)區(qū)域打分V(i,j)(分?jǐn)?shù)可正可負(fù))。Z鎮(zhèn)的名勝位于這些區(qū)域內(nèi)
教學(xué)教案相關(guān)推薦
鄂ICP備17016276號(hào)-1