全TLE求救
查看原帖
全TLE求救
876268
tanzexiaodezhonghao楼主2024/4/5 21:30
#include<bits/stdc++.h>
using namespace std;
const int N=100010;
#define ll long long
struct node{
    ll data,high,gonext;
}a[N];
int n;
ll ans;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].high;
        a[i].data=a[i].high;
        a[i].gonext=a[i].high;
    }
    a[0].data=a[n].data;
    a[0].high=a[0].data;
    a[0].gonext=a[0].high;
    //cout<<a[0].data<<endl;
    for(int i=1;i<=n;i++){
        ans=0;
        for(int j=1;j<=n;j++){
            a[j].gonext=a[j].data;
            a[j].data=abs(min(a[j].high,a[j-1].gonext));
            ans+=a[j].data;
            //cout<<a[j].data<<" ";
        }
        a[0].data=a[n].data;
        a[0].gonext=a[n].gonext;
        cout<<ans<<" ";
    }
    return 0;
}
2024/4/5 21:30
加载中...