Submission #48511

#TimeUsernameProblemLanguageResultExecution timeMemory
48511leehosu01수족관 3 (KOI13_aqua3)C++17
18 / 100
1073 ms2876 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll cut[300002],N,K; ll pro(int loc) { ll tot=0,dep=1ll<<54; for(int i=loc;i<N-2;i+=2) tot+=(cut[i+2]-cut[i])*(dep=min(dep,cut[i+1])); dep=1ll<<54; for(int i=loc;i>0;i-=2) tot+=(cut[i]-cut[i-2])*(dep=min(dep,cut[i-1])); return tot; } int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>N; int i; ll aA[2]; for(i=0;i<N;i++) { cin>>aA[0]>>aA[1]; cut[i]=aA[i&1]; } cin>>K; ll fl=0; for(i=0;i<N;i+=2)fl=max(fl,pro(i)); printf("%lld",fl); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...