#261B. Pashmak and Flowers
2016-04-21 18:55
274 查看
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 类型的。
#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 类型的。
相关文章推荐
- #274A. Expression
- 选前5 名的链表问题
- #274B. Towers
- CF 261A. Pashmak and Garden
- HDU 1181 变形课
- 使用grunt实现css压缩
- #267B. Fedor and New Game-----每日两道水(1)
- PCA的数学原理
- HDU1241 Oil Deposits
- 英语演讲
- ACM牡丹江区域赛
- HDU 5059 help him
- HDU4802 GPA
- 快速排序的递归形式与非递归形式(C++版)
- HDU4496 D-City
- HDU4736-Fibonacci Tree
- 安卓游戏 h5游戏 安卓activity+webview+h5=2048程序员版 只有程序员才能玩的懂的2048升级版html离线小游戏 2048安卓程序员版 android2048
- 常见面试之机器学习算法思想简单梳理
- do-while随机求十个数的和
- HDU4493 Tutor