Submission #510284

#TimeUsernameProblemLanguageResultExecution timeMemory
510284salamhassanNizin (COCI16_nizin)C++14
30 / 100
136 ms9912 KiB
#include <bits/stdc++.h> using namespace std; long long a[1000007],n,l,r,ans; int main() { cin>>n; for (int i=0; i<n; i++) { cin>>a[i]; } l=0; r=n-1; while (l<=n/2) { if (a[l]==a[r]) { l++; r--; } while (r>=n/2 && a[l]!=a[r]) { if (a[l]>a[r]) { a[r-1]+=a[r]; r--; n--; ans++; } else { a[l+1]+=a[l]; l++; ans++; } } } cout<<ans; return 0; }
#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...
#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...