zoukankan      html  css  js  c++  java
  • hdu 5742 It's All In The Mind

    It's All In The Mind

    #include<iostream>
    #include<stdio.h>
    using namespace std;
    int gcd(int a , int b)
    {
    
           if(b==0) return a;
              a%=b;
                 return gcd(b,a);
    }
    int main(){
        int t;
        int num[1005];
        scanf("%d",&t);
        while(t--){
            int n,m;
            scanf("%d%d",&n,&m);
            for(int i=0;i<=n;i++) num[i]=-1;
            for(int i=0;i<m;i++ ){
                int tmp1,tmp2;
                scanf("%d%d",&tmp1,&tmp2);
                num[tmp1]=tmp2;
            }
            int sum=0;
            if(num[1]==-1) num[1]=100;
            if(num[2]==-1) num[2]=num[1];
            int tmp=0;
            for(int i=n;i>2;i--){
                if(num[i]==-1) num[i]=tmp;
                else{
                    tmp=num[i];
                }
                sum+=num[i];
            }
            int div=gcd(sum+num[1]+num[2],num[1]+num[2]);
            if(div)
              printf("%d/%d
    ",(num[1]+num[2])/div,(sum+num[1]+num[2])/div);
            else printf("0/1
    ");
        }
        return 0;
    }
    View Code

    首先判断 最后到结果是关于a1,a2的增函数,关于剩余和到减函数,令a1,a2尽可能大,其余数的和尽可能小就可以了。

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 565    Accepted Submission(s): 247


    Problem Description
    Professor Zhang has a number sequence a1,a2,...,an. However, the sequence is not complete and some elements are missing. Fortunately, Professor Zhang remembers some properties of the sequence:

    1. For every i{1,2,...,n}0ai100.
    2. The sequence is non-increasing, i.e. a1a2...an.
    3. The sum of all elements in the sequence is not zero.

    Professor Zhang wants to know the maximum value of a1+a2ni=1ai among all the possible sequences.
     
    Input
    There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

    The first contains two integers n and m (2n100,0mn) -- the length of the sequence and the number of known elements.

    In the next m lines, each contains two integers xi and yi (1xin,0yi100,xi<xi+1,yiyi+1), indicating that axi=yi.
     
    Output
    For each test case, output the answer as an irreducible fraction "p/q", where pq are integers, q>0.
     
    Sample Input
    2 2 0 3 1 3 1
     
    Sample Output
    1/1 200/201
     
    Author
    zimpha
     
    Source
     
    Recommend
    wange2014   |   We have carefully selected several similar problems for you:  5746 5745 5743 5741 5740 
  • 相关阅读:
    7-1 城市间紧急救援 (25 分)(最短路径:斯特拉算法)
    常见的MD5碰撞
    PHP常见绕过(更新ing)
    7-10 旅游规划 (25 分)
    杂记:用python向网页提交数据
    python学习日记
    NOIP2018提高组金牌训练营——搜索专题
    noip复习之拓扑排序
    NOIP2018提高组金牌训练营——字符串专题
    NOIP2018提高组金牌训练营——数论专题
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5694631.html
Copyright © 2011-2022 走看看