Submission #473147

#TimeUsernameProblemLanguageResultExecution timeMemory
473147SaraMostafaDoktor (COCI17_doktor)C++14
20 / 100
1096 ms4656 KiB
#include <bits/stdc++.h> #include<unordered_map> using namespace std; #define ll long long #define endl "\n" #define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); const long long mod=1e9+7; const double PI=acos(-1); // 1 2 3 --> 1,2,3 ...1,2..1,3..1..2,3..2..3..none (2 power number of elements) //1 2 3 --> 2--> 1,2..1,3..2,3..(!n/(r!(n-r)!)) aka:ncr // 1 2 3 -->2-->1,2..2,1..1,3..3,1..2,3..3,2..(n!/(n-r)!) aka:npr //1 2 3--> 1..1,2..1,2,3..2..2,3..3 number of subarrays -->(n*(n+1))/2 "sum of numbers from 1 to n." /* ll power(ll x,ll y) { if(y==0) return 1; else if(y==1) return x%mod; ll r=power(x%mod,((y%mod)/2)%mod); if(y%2==0) return ((r%mod)*(r%mod)); else return ((r%mod)*(r%mod)*(x%mod)); } ll inverse(ll md,ll x) { return power(x%mod,mod-2); } */ int main() { //freopen("input.in","r",stdin); Sara int n; cin>>n; ll mx=0,cnt=0; vector<ll>v(n); ll st=1,nd=1; for(int i=0; i<n; i++) cin>>v[i]; for(int l=0; l<n; l++) { for(int r=l; r<n; r++) { cnt=0; for(int i=0; i<n; i++) { if(v[i]==(l+1)+((r+1)-(i+1))) cnt++; } if(cnt>mx) { st=v[l]; nd=v[r]; mx=cnt; } } } cout<<st<<' '<<nd<<endl; 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...