KT-Yeh

#include <cstdio>
#include <vector>
using namespace std;
#define Inf 99999999
struct Edge{
    int A;
    int B;
    int Time;
}E[100];
int nOfE;

KT-Yeh

#include <cstdio>
using namespace std;
#define Inf 99999999

struct Edge{
    int x;
    int y;
    int Len;
}E[3000];
int Dis[1001];

KT-Yeh

#include <cstdio>
using namespace std;
#define Inf 99999999

struct Edge{
    int x;
    int y;
    int Len;
}E[2001];
int Dis[1001];

KT-Yeh

#include <cstdio>
#include <algorithm>
using namespace std;

int N;
int num[100001];
int LIS[100001];  //LIS的Stack
int lis[100001];  //每個數字LIS的表
int LDS[100001];
int lds[100001];

KT-Yeh

#include <cstdio>
#include <algorithm>
using namespace std;
struct Block{
    int L;
    int W;
    int H;
}B[300];
int nOfB;

KT-Yeh

#include <iostream>
#include <string>
using namespace std;

string Matrix[1000];
bool is1(int i, int i_end, int j);

int main()
{
    ios::sync_with_stdio(false);

KT-Yeh

#include <cstdio>
using namespace std;
int num[20001];
int main()
{
    int Case, S;
    scanf("%d", &Case);
    for (int i = 1; i <= Case; ++i)
    {
        int num, MSS = -1, Start = -1, End = -1;

KT-Yeh

#include <cstdio>
#include <vector>
using namespace std;
int main()
{
    int Case = 1, LIS[100000];
    while (1) {
        int num;
        vector<int> height;

KT-Yeh

#include <cstdio>
#include <algorithm>
using namespace std;

int N, pos, Ans[30], num[30], LCS[30][30] = {0};

int main()
{
    scanf("%d", &N);
    for (int i = 1; i <= N; ++i) {

KT-Yeh

#include <cstdio>
using namespace std;
int main()
{
    int N, num;
    while (scanf("%d", &N) && N) {
        int Max = 0;
        int MSS = -1;
        while (N--) {
            scanf("%d", &num);