1491（未完成）

1492

#include 
   
    #define M 100#define N 10int main(void){    int n, m, i, j, k, r;    int a[M][M];    int sum, min;    while (scanf("%d%d", &m, &n) != EOF)    {        for(i=0; i

1493

#include 
   
    #include 
    
     int zdgys(int a, int b){    if (b == 0)        return a;    return zdgys(b, a%b);}int main(){    int i, a, b;    int max;    while(scanf("%d%d", &a, &b) != EOF)    {        if (a >= b)            max = zdgys(a, b);        else            max = zdgys(b, a);        int count = 0;        for (i=1; i

1494-1497（未完成）

1498

#include 
   
    int n;char op[15];void print(){    int i;    for (i=1; i<=n; i++)    {        printf("%d", i);        if (i < n)            printf("%c", op[i]);    }    printf("\n");}int compute(){    int i, a, b;    char c;    a = 0;    b = 1;    c = '+';    for (i=1; i
    
     = 10)                b = 100*b+(i+1);            else                b = 10*b+(i+1);        }        else        {            if (c == '+')                a = a+b;            else                a = a-b;            c = op[i];            b = i+1;        }    }    if (c == '+')        a = a+b;    else        a = a-b;    return a;}void DFS(int i){    if (i == n)    {        int res = compute();        if (res == 0)            print();        return;    }    op[i] = ' ';    DFS(i+1);    op[i] = '+';    DFS(i+1);    op[i] = '-';    DFS(i+1);}int main(void){    while (scanf("%d", &n) != EOF)    {        DFS(1);    }    return 0;}/**************************************************************    Problem: 1498    User: liangrx06    Language: C    Result: Accepted    Time:420 ms    Memory:912 kb****************************************************************/

1499

#include 
   
    #include 
    
     #include 
     
      #define N 10000typedef struct node {    int st;    int ed;    int val;} Prog;int cmp(const void *a, const void *b){    return ((Prog *)a)->ed - ((Prog *)b)->ed;}int main(void){    int n, i, j;    Prog b[N+1];    int m[N+1];    while (scanf("%d", &n) != EOF)    {        for(i=1; i<=n; i++)            scanf("%d%d%d", &b[i].st, &b[i].ed, &b[i].val);        qsort(b+1, n, sizeof(b[0]), cmp);        memset(m, 0, sizeof(m));        for(i=1; i<=n; i++)        {            m[i] = (b[i].val>m[i-1]) ? b[i].val : m[i-1];            for (j=i-1; j>=0; j--)            {                if (b[i].st >= b[j].ed && m[i] < m[j]+b[i].val)                    m[i] = m[j] + b[i].val;            }        }        printf("%d\n", m[n]);    }    return 0;}/**************************************************************    Problem: 1499    User: liangrx06    Language: C    Result: Accepted    Time:340 ms    Memory:1004 kb****************************************************************/

1500

#include 
   
    #define N 1000000int big[N], count;int up[N], down[N];void print(int x[N], int c){    for (int i=0; i
    
     = k)        return binSearch(begin, mid, k);    else        return binSearch(mid+1, end, k);}int insert(int k){    int j;    j = binSearch(0, count-1, k);    //printf("j=%d, count=%d\n", j, count);    if (j == count-1 || big[j+1] > k)    {        big[j+1] = k;        if (j == count-1)            count ++;    }    //print(big, count);    return j+2;}int main(void){    int a[N], n, i;    while (scanf("%d", &n) != EOF)    {        for(i=0; i
     
      =0; i--)            down[i] = insert(a[i]);        int max = 0;        for (i=0; i
      
        max)                max = up[i]+down[i];        }        printf("%d\n", n-max+1);    }    return 0;}/**************************************************************    Problem: 1500    User: liangrx06    Language: C    Result: Accepted    Time:1100 ms    Memory:16468 kb****************************************************************/