栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

zoj 1338 Up and Down Sequences

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

zoj 1338 Up and Down Sequences

#include <stdio.h>#include <stdlib.h>#include <iostream>#include <string.h>using namespace std;int num[35];int main(){int len,i,n,x,flag,up,upnum,down,downnum,tmp,ff;while( scanf("%d",&n) && n ){len = 1;num[0] = n;while( scanf("%d",&x) && x )num[len++] = x;up = upnum = down = downnum = tmp = 0;ff = flag = 0;for(i=1; i<len; i++){if( num[i] == num[i-1] ){if( !flag && !ff )tmp++; if( flag ) down++;if( ff )up++;}if( num[i] < num[i-1] ){ff = 0;  if( !flag ){flag = 1; downnum++;}down++;down += tmp;  tmp = 0;}if( num[i] > num[i-1] ){flag = 0;if( !ff ){upnum++;ff = 1;}up++;up += tmp;tmp = 0;}}double ansup,ansdown;if( upnum == 0 )  ansup = 0;elseansup = (double)up/upnum;if( downnum == 0 )ansdown = 0;elseansdown = (double)down/downnum;printf("Nr values = %d:  %.6lf %.6lfn",len,ansup,ansdown);}        return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/377617.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号