Gene Assembly

---

Time Limit: 1 Second      Memory Limit: 32768 KB

---

Statement of the Problem

With the large amount of genomic DNA sequence data being made available, it is becoming more important to find genes (parts of the genomic DNA which are responsible for the synthesis of proteins) in these sequences. It is known that for eukaryotes (in contrast to prokaryotes) the process is more complicated, because of the presence of junk DNA that interrupts the coding region of genes in the genomic sequence. That is, a gene is composed by several pieces (called exons) of coding regions. It is known that the order of the exons is maintained in the protein synthesis process, but the number of exons and their lengths can be arbitrary.

Most gene finding algorithms have two steps: in the first they search for possible exons; in the second they try to assemble a largest possible gene, by finding a chain with the largest possible number of exons. This chain must obey the order in which the exons appear in the genomic sequence. We say that exon i appears before exon j if the end of i precedes the beginning of j.

The objective of this problem is, given a set of possible exons, to find the chain with the largest possible number of exons that cound be assembled to generate a gene.

Input Format

Several input instances are given. Each instance begins with the number 0 < n < 1000 of possible exons in the sequence. Then, each of the next n lines contains a pair of integer numbers that represent the position in which the exon starts and ends in the genomic sequence. You can suppose that the genomic sequence has at most 50000 basis. The input ends with a line with a single 0.

Output Format

For each input instance your program should print in one line the chain with the largest possible number of exons, by enumerating the exons in the chain. If there is more than one chain with the same number of exons, your program can print anyone of them.

Sample Input

6
340 500
220 470
100 300
880 943
525 556
612 776
3
705 773
124 337
453 665
0

Sample Output

3 1 5 6 4
2 3 1

---

Source: South America 2001

分析：此问题是典型的动态规划问题，确定状态转移方程即可。

#include <iostream> #include <algorithm> using namespace std; struct exon { int start; int end; int index; }; exon exons[1001]; int indexs[1001]; int n; bool judgef(exon a, exon b) { return a.start < b.start; } int func(int i, int e) { if (i == 0) { return 0; } if (exons[i].end > e) { indexs[i] = 0; return func(i-1, e); } // return max(func(i-1, e), func(i-1, exons[i].start) + 1); int a = func(i-1, e); int b = func(i-1, exons[i].start) + 1; if (a > b) { indexs[i] = 0; return a; } else { indexs[i] = exons[i].index; return b; } } int main(void) { while (cin>>n) { if (n == 0) break; for (int i = 1; i <= n; ++i) { cin >> exons[i].start >> exons[i].end; exons[i].index = i; } sort(exons+1, exons+n+1, judgef); int num = func(n, 50000); for (int i = 1, j = 1; i <= n; ++i) { if (indexs[i]) { if (j++ != num) cout << indexs[i] << " "; else cout << indexs[i]; } } cout << endl; } return 0; }