Tag: Codeforces Round #424 (Div. 2
Codeforces Round #424 (Div....
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a; long long k,ans=0;
int main(){
scanf("%d%lld",&n,&k);
for (int...
Codeforces Round #424 (Div....
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e3+5;
int main(){
int n,k,p,a,b;
int res=INT_MAX,i,j;
cin>>n>>k>>p;
for(i=0;i<n;i++) scanf("%d",a+i);
for(i=0;i<k;i++)...
Codeforces Round #424 (Div....
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>k>>n;
int t;
int arr;
set<int>c;
for(int i=0;i<k;i++){
cin>>t;
arr= arr+t;
}
for(int...
Codeforces Round #424 (Div....
#include <bits/stdc++.h>
using namespace std;
string s1, s2, t;
int main() {
cin...
Codeforces Round #424 (Div....
#include<cstdio>
using namespace std;
int n,i,la,nw,fl,tp;
int main(){
for(scanf("%d%d",&n,&la);++i<n;la=nw,fl=tp)
if(scanf("%d",&nw),fl>(tp=(nw>la?0:(nw<la?2:1))))return puts("NO");
return puts("YES");
}