原创 實驗二 線性表的鏈式表示與實現

#include<stdio.h> #include<stdlib.h> typedef int elemtype; typedef struct node { elemtype data; struct node *next; }n

原创 uva 507 - Jill Rides Again

Jill Rides Again Jill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, J

原创 uva 10020 - Minimal coverage

Minimal coverage The Problem Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to

原创 uva 10405 - Longest Common Subsequence

Problem C: Longest Common Subsequence Sequence 1: Sequence 2: Given two sequences of characters, print the length of

原创 uva 10487 - Closest Sums

Problem DClosest SumsInput: standard inputOutput: standard outputTime Limit: 3 seconds Given is a set of integers and