Codeforces Round #297 (Div. 2) C - Ilya and Sticks

简单贪心，注意求的是矩形面积总和。。

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define maxm 300005
#define eps 1e-3
#define mod 9999677
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
//head

int a[maxn];

int cmp(int a, int b)
{
	return a > b;
}

int n;

void work()
{
	scanf("%d", &n);
	for(int i = 0; i < n; i++) scanf("%d", &a[i]);
	sort(a, a+n, cmp);
	LL ans = 0, mx = -1;
	for(int i = 1; i < n; i++) {
		if(a[i] == a[i-1] || a[i] == a[i-1]-1) {
			if(mx == -1) mx = a[i];
			else {
				ans += mx * a[i];
				mx = -1;
			}
			i++;
		}
	}
	printf("%I64d\n", ans);
}

int main()
{
	work();

	return 0;
}