poj 2231 Moo Volume

来源：互联网发布：叙永网络歌手大赛歌名编辑：程序博客网时间：2024/06/01 09:50

n*n的做法会超时，10^8居然会超时时间大于1s，是poj编译器的问题？
需要减少操作的步数。简单的模拟

#include<iostream>#include<string.h>#include<math.h>#include<fstream>#include<algorithm>#include<stdio.h>#include<queue>#include<vector> #define MAXSIZE 100using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) < (b) ? (a) : (b)) typedef long long int ll;int  N = 0;ll dat[10010];ll ans = 0;int main(){    //freopen("data_2231.txt","r",stdin);    while(scanf("%d", &N) != EOF)    {        ans = 0;        for (int i = 0; i < N; i++)        {            scanf("%lld", &dat[i]);        }        sort (dat, dat + N);        for (int i = 0; i < N; i++)        {            for (int j = 0; j < i; j++)            {                    ans += (long)abs ((long)(dat[j] - dat[i]));                         }        }        printf("%lld\n", 2 * ans);    }    return 0;}

0 0