Pagini recente » Cod sursa (job #2684573) | Cod sursa (job #2707918) | Cod sursa (job #1247439) | Cod sursa (job #2037875) | Cod sursa (job #3208402)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int MAX_LENGTH = 100000;
int main() {
int numLen;
fin >> numLen;
int nums[MAX_LENGTH + 1];
for (int i = 1; i <= numLen; ++i) {
fin >> nums[i];
}
int maxSubsequenceLen[MAX_LENGTH + 1], answer = 0;
maxSubsequenceLen[0] = 0;
for (int i = 1; i <= numLen; ++i) {
int maxLen = 0, maxLenPos = 0;
for (int j = 1; j < i; ++j) {
if (maxSubsequenceLen[j] > maxLen && nums[j] < nums[i]) {
maxLen = maxSubsequenceLen[j];
maxLenPos = j;
}
}
maxSubsequenceLen[i] = maxSubsequenceLen[maxLenPos] + 1;
answer = max(maxSubsequenceLen[i], answer);
}
fout << answer;
return 0;
}