Submission #1033227

#TimeUsernameProblemLanguageResultExecution timeMemory
1033227MarwenElarbiSure Bet (CEOI17_sure)C++17
0 / 100
0 ms460 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define fi first #define se second #define ll long long #define pb push_back #define ii pair<int,int> template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; const int nax=1e5+5; #define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int main() { optimise; int n; cin>>n; double a[n]; double b[n]; for (int i = 0; i < n; ++i) { cin>>a[i]; cin>>b[i]; } pair<double,double> cnt={0,0}; double ans=0; for (int i = 0; i < n; ++i) { cnt.se=0; cnt.fi+=a[i]; for (int j = 0; j < n; ++j) { cnt.se+=b[j]; ans=max(ans,min(cnt.fi,cnt.se)-(j+i+1+1)); } } cout <<fixed<<setprecision(4)<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...