蒟蒻求助

P2234 [HNOI2002] 营业额统计

呵呵呵呵呵呵呵呵
by KCID @ 2019-04-20 13:50:14


```cpp #include <bits/stdc++.h> #define ri register int using namespace std; struct node{ int data,num; }a[32768]; int n; int cmp(node a,node b){ return a.data<b.data; } int get_accerYG(int x){ if(a[x].num==1)return a[x].data; else { int p=0x7ffffff,p1=0x7fffffff; for (ri i = x ; i <= n ;i++){ if(a[i].num<a[x].num) {p=abs(a[i].data-a[x].data);break;} } for (ri i = x ; i >= 1 ;i--){ if(a[i].num<a[x].num) {p1=abs(a[i].data-a[x].data);break;} } return min(p1,p); } } int main(){ int j,k,m,res=0; cin>>n; for (ri i = 1 ; i <= n; i++) cin>>a[i].data,a[i].num=i; sort(a+1,a+1+n,cmp); for (ri i = 1 ; i <= n; i++) res+=get_accerYG(i); cout<<res; return 0; } ```
by KCID @ 2019-04-20 13:50:42


吓得 我赶紧上代码
by KCID @ 2019-04-20 13:51:04


$QAQ$
by Vanity_ @ 2019-04-20 13:51:57


%%%wzdalao
by 花园Serena @ 2019-04-20 13:57:21


~~cao原来是0x7fffffff炸了~~
by Vanity_ @ 2019-04-20 14:00:57


|