#261B. Pashmak and Flowers

来源：互联网发布：现货分时指标公式源码编辑：程序博客网时间：2024/06/08 01:04

http://codeforces.com/contest/459/problem/B

这道题还是挺简单的，发现CF B题处理极值的还是挺多的。刚开始以为会超时，用的printf()但得用 long long类型输出，因为m*n可能超int

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>

#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b){
    return a>b;
}
ll a[200005];
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ll n;
    cin>>n;
    ll Max=-1,Min=INF;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if(Max<a[i])
        {
            Max=a[i];
        }
        if(Min>a[i])
        {
            Min=a[i];
        }
    }
    if(Max==Min) printf("%I64d %I64d\n",Max-Min,n*(n-1)/2);
    else{ll m=0,p=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==Min)m++;
        if(a[i]==Max)p++;
    }
    printf("%I64d %I64d\n",Max-Min,m*p);
    }
    return 0;
}

注n 也应该是long long 类型的。

0 0