1338.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<cstdio>

int main()
{
    freopen ("in.txt","r",stdin);
    int temp,flag,ups,upc,dos,doc,ct,prev,n;
    while(scanf("%d",&temp)&&temp > 0)
    {
        n=0;
        flag=-1;
        ups=0;
        upc=0;
        dos=0;
        doc=0;
        while(temp > 0)
        {
            n++;
            switch(flag)
            {
                case -1:{flag=0;ct=0;break;}
                case 0:{ct++;if(temp>prev) flag=1;if(temp<prev) flag=2;break;}
                case 1:{if(temp >= prev) ct++;else{ups += ct;ct=1;upc++;flag=2;}break;}
                case 2:{if(temp <= prev) ct++;else{dos += ct;ct=1;doc++;flag=1;}break;}
            }
            prev=temp;
            scanf("%d",&temp);
        }
        if (flag==1) 
        { 
            ups+=ct; 
            upc++; 
        } 
        if (flag==2) 
        { 
            dos+=ct; 
            doc++; 
        } 
        if (upc==0) 
        { 
            ups=0; 
            upc++; 
        } 
        if (doc==0) 
        {  
            dos=0; 
            doc++; 
        }
        printf("Nr values = %d:  ",n); 
        printf("%.6lf %.6lf\n",(double)ups/upc,(double)dos/doc);  
    }
}