content
stringlengths 19
11k
|
|---|
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
int main()
{
int N;
scanf("%i", &N);
int arr[N];
for(int i = 0; i < N; i++)
{
scanf("%i", &arr[i]);
}
for(int i = 0; i < N; i++)
{
if(arr[i] % 2 == 1)
{
printf("%i", arr[i]);
}
else if(arr[i] % 2 == 0)
{
printf("%i", arr[i] - 1);
}
if(i < N - 1)
{
printf(" ");
}
}
}
|
#include"stdio.h"
int main()
{
long long N,i;
long long a[10000];
long long min;
while(~scanf("%lld",&N))
{
min=999999999999;
for(i=0;i<N;i++)
{scanf("%lld",&a[i]);
}
for(i=0;i<N-1;i++)
{
if(a[i]%2==0)
printf("%lld ",a[i]-1);
else
printf("%lld ",a[i]);
}
if(a[i]%2==0)
printf("%lld\n",a[i]-1);
else
printf("%lld\n",a[i]);
}
}
|
#include "stdio.h"
#define MAX_PRESENT_SIZE 1000
#define BIG_BASE "%ld"
#define BASE "%d"
typedef int Base;
typedef long int BigBase;
int main()
{
Base PresentSize = 0;
BigBase PresentValues[MAX_PRESENT_SIZE] = { 0 };
scanf(BASE, &PresentSize);
for (Base i = 0; i < PresentSize; i++)
{
scanf(BIG_BASE, &PresentValues[i]);
if (PresentValues[i] % 2)
{
PresentValues[i]++;
}
}
for (Base i = 0; i < PresentSize; i++)
{
if (PresentValues[i] % 2 == 0)
{
PresentValues[i]--;
}
}
for (Base i = 0; i < PresentSize; i++)
{
printf(BIG_BASE" ", PresentValues[i]);
}
printf("\n");
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main ()
{
int n,i,ban,min,j;
scanf ("%d",&n);
int a[n];
min=pow(10,9);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
if (a[i]<min)
min=a[i];
}
if ((min%2)==0)
ban=0;
else
ban=1;
//for (j=1;j<=2;j++){
for (i=0;i<n;i++)
{
if ((a[i]%2)==0){
a[i]=a[i]-1;
}/*else if ((a[i]%2)==1)
a[i]=a[i]+1;*/
}
/* if (ban==0)
ban=1;
else
ban=0;*/
//}
for (i=0;i<n;i++)
{
printf("%d",a[i]);
if (i<(n-1))
printf(" ");
}
return 0;
}
|
#include <stdio.h>
#include <math.h>
#include <malloc.h>
#include <stdlib.h>
int particion (int a[],int ini, int fin);
void quicksort (int a[],int ini, int fin);
void swap (int a[],int x,int y);
int main(void){
int n;
int i, j, cont=1;;
scanf ( "%d", &n );
int vec[n];
for ( i = 0; i < n; i++){
scanf ( "%d", &vec[i] );
}
//quicksort( vec, 0, n - 1 );
for (j=0; j<n; j++)
{
if (vec[j]%2==0)
{
vec[j]-=1;
//printf("A\n");
}
}
for ( i = 0; i < n; i++ ){
printf ( "%d ", vec[i] );
}
printf("\n");
}
void quicksort (int a[],int ini, int fin) //cada vez que se llama a quicksort un nuevo pivot va colocandose en su posicion
{
int piv;
if (ini<fin)
{ //cont++;
piv=particion(a,ini,fin);
quicksort(a,ini,piv-1); //como el pivot ya esta en su ubicacion se divide en dos y se vuelve a llamar
quicksort(a,piv+1,fin); //a quicksort pero sin tocar el pivot
}
}
int particion (int a[],int ini, int fin) //particion ubica al pivot en su posicion y devulve esa posicion
{
int pivot,i,j;
pivot=a[fin];
i=ini;
for (j=ini;j<fin;j++)
{
if (a[j]<pivot)
{
swap(a,j,i);
i++;
}
}
swap(a,i,fin);
return i;
}
void swap (int a[],int x,int y)
{
int aux;
aux=a[x];
a[x]=a[y];
a[y]=aux;
}
|
#include<stdio.h>
void merge(int a[],int b[],int,int);
void mergesort(int a[],int b[],int low ,int high) {
if(low < high) {
int mid = (high+low)/2;
mergesort(a,b,low,mid);
mergesort(a,b,mid+1,high);
merge(a,b,low,high);
}
}
void merge(int a[],int b[],int low,int high) {
int mid=(high+low)/2;
int i=low,j=mid+1,temp1[high-low+1],temp2[high-low+1],k=0;
while(i <= mid && j<=high) {
if(a[i] <= a[j]) {
temp1[k]=a[i];
temp2[k]=b[i];
k++;
i++;
}
else {
temp1[k]=a[j];
temp2[k]=b[j];
k++;
j++;
}
}
while(i <= mid) {
temp1[k]=a[i];
temp2[k]=b[i];
k++;
i++;
}
while(j <= high) {
temp1[k]=a[j];
temp2[k]=b[j];
k++;
j++;
}
k=0;
for(i=low; i <= high; i++) {
a[i]=temp1[k];
b[i]=temp2[k];
k++;
}
}
int main() {
int n;
scanf("%d",&n);
int a[n],b[n],c[1000];
for(int i=0; i < n; i++) {
scanf("%d",&a[i]);
}
for(int i=0; i < n; i++) {
b[i]=i;
}
mergesort(a,b,0,n-1);
int ele=a[0];
c[0]=ele;
int pos=1;
for(int i=1; i < n; i++) {
if(a[i] != ele) {
c[pos++]=a[i];
ele=a[i];
}
}
for(int i=0; i < pos; i++) {
for(int j=0; j < n; j++) {
if(a[j]==c[i]) {
if(a[j]%2==0)
a[j]=a[j]-1;
else
a[j]=a[j]+1;
}
}
if(c[i]+1 != c[i+1]) {
ele=c[i]+1;
for(int j=0; j < n; j++) {
if(a[j]==ele) {
if(a[j]%2==0)
a[j]=a[j]-1;
else
a[j]=a[j]+1;
}
}
}
}
mergesort(b,a,0,n-1);
for(int i=0; i < n; i++)
printf("%d ",a[i]);
}
|
#include <stdio.h>
void merge(int a[],int b[],int l,int h) {
int m = (l + h) / 2;
int i = l,j = m + 1,c[h - l + 1],d[h - l + 1],k = 0;
while(i <= m && j <= h) {
if(a[i] <= a[j]) {
c[k] = a[i];
d[k] = b[i];
k++;
i++;
}
else {
c[k] = a[j];
d[k] = b[j];
k++;
j++;
}
}
while(i <= m) {
c[k] = a[i];
d[k] = b[i];
k++;
i++;
}
while(j <= h) {
c[k] = a[j];
d[k] = b[j];
k++;
j++;
}
k = 0;
for(i = l; i <= h; i++) {
a[i] = c[k];
b[i] = d[k];
k++;
}
}
void mergesort(int a[],int b[],int l,int h) {
if(l < h) {
int m = (l + h) / 2;
mergesort(a,b,l,m);
mergesort(a,b,m + 1,h);
merge(a,b,l,h);
}
}
int main() {
int n;
scanf("%d",&n);
int a[n],b[n],c[1000];
for(int i = 0; i < n; i++) {
scanf("%d",&a[i]);
b[i] = i;
}
mergesort(a,b,0,n - 1);
int e = a[0];
c[0] = e;
int pos = 1;
for(int i = 0; i < n; i++) {
if(a[i] != e) {
c[pos++] = a[i];
e = a[i];
}
}
for(int i = 0; i < pos; i++) {
for(int j = 0; j < n; j++) {
if(a[j] == c[i]) {
if(a[j] % 2 == 0) {
a[j]--;
}
else {
a[j]++;
}
}
}
if(c[i] + 1 != c[i + 1]) {
e = c[i] + 1;
for(int j = 0; j < n; j++) {
if(a[j] == e) {
if(a[j] % 2 == 0) {
a[j]--;
}
else {
a[j]++;
}
}
}
}
}
mergesort(b,a,0,n - 1);
for(int i = 0; i < n; i++) {
printf("%d ",a[i]);
}
}
|
#include<stdio.h>
#include<stdlib.h>
int main() {
int i, j, nbrOfElement, max = 0;
// Input number of elements in the array
scanf("%d", &nbrOfElement);
// Input the elements of the array
int *array = (int *)calloc(nbrOfElement, sizeof(int));
int found, index = 0, *distinctValues = (int *)calloc(nbrOfElement * 2, sizeof(int));
for (i = 0; i < nbrOfElement; i++)
{
scanf("%d", &(*(array + i)));
if (max < *(array + i))
{
max = *(array + i);
}
found = 0;
for (j = 0; j < index; j++)
{
if (*(distinctValues + j) == *(array + i))
{
found = 1;
break;
}
}
if (found == 0)
{
if (*(array + i) % 2 == 0)
{
*(distinctValues + index) = *(array + i) - 1;
index++;
*(distinctValues + index) = *(array + i);
index++;
}
else
{
*(distinctValues + index) = *(array + i);
index++;
*(distinctValues + index) = *(array + i) + 1;
index++;
}
/*
*(distinctValues + index) = *(array + i);
index++;
if (*(distinctValues + index - 1) % 2 == 0)
{
*(distinctValues + index) = *(distinctValues + index - 1) - 1;
index++;
}
else
{
*(distinctValues + index) = *(distinctValues + index - 1) + 1;
index++;
}
*/
}
}
/*
printf("Given Array :\n");
for (i = 0; i < nbrOfElement; i++)
{
printf("%d ", *(array + i));
}
printf("\n");
*/
/*
printf("Distinct Array :\n");
for (i = 0; i < index; i++)
{
printf("%d ", *(distinctValues + i));
}
printf("\n");
*/
// Modifying the array
int value, change_factor = 0;
for (i = 0; i < index; i++)
{
value = *(distinctValues + i);
if (value % 2 == 0)
{
change_factor = -1;
}
else
{
change_factor = 1;
}
for (j = 0; j < nbrOfElement; j++)
{
if (*(array + j) == value)
{
*(array + j) = *(array + j) + change_factor;
}
}
}
// Print the modified array
//printf("Modified Array :\n");
for (i = 0; i < nbrOfElement; i++)
{
printf("%d ", *(array + i));
}
printf("\n");
// Free the memory
free(array);
free(distinctValues);
return 0;
}
// End of main.
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
typedef unsigned long long int ull;
int compare(const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
void swap(int *x,int *y)
{
int temp=*x;
*x=*y;
*y=temp;
}
int max(int x,int y)
{
return x>y?x:y;
}
int min(int x,int y)
{
return x<y?x:y;
}
int abs(int x)
{
return x<0?(-1)*x:x;
}
int arrayMax(int *array,int n)
{
int max=INT_MIN;
for(int i=0;i<n;i++)
{
if(array[i]>max)
{
max=array[i];
}
}
return max;
}
void arrayReverse(int *array,int n)
{
int l=0;
int h=n-1;
while(l<h)
{
swap(&array[l],&array[h]);
l++;
h--;
}
}
int arrayMin(int *array,int n)
{
int min=INT_MAX;
for(int i=0;i<n;i++)
{
if(array[i]<min)
{
min=array[i];
}
}
return min;
}
int arraySum(int *array,int n)
{
int sum=0;
for(int i=0;i<n;i++)
{
sum+=array[i];
}
return sum;
}
void arrayPrint(int *array,int n)
{
for(int i=0;i<n;i++)
{
printf("%d ",array[i]);
}
}
void arrayScan(int *array,int n,int index)
{
if(index==0)
{
for(int i=0;i<n;i++)
{
scanf("%d",&array[i]);
}
}
else
{
for(int i=1;i<=n;i++)
{
scanf("%d",&array[i]);
}
}
}
void arrayInit(int *array,int n,int value)
{
for(int i=0;i<n;i++)
{
array[i]=value;
}
}
void arraySort(int *array,int n)
{
qsort(array,n,sizeof(array[0]),compare);
}
char *SieveOfEratosthenes(int n)
{
char *prime=(char *)calloc(sizeof(char),n+1);
for(int i=0;i<n;i++)
{
prime[i]=1;
}
for (int p=2;p*p<=n;p++)
{
if (prime[p] == 1)
{
for (int i=p*p; i<=n; i += p)
prime[i] = 0;
}
}
return prime;
}
int gcd(int x,int y)
{
if(y==0)
{
return x;
}
return gcd(y,x%y);
}
double abs_double(double x)
{
return x<0.0?(-1)*x:x;
}
int set_bits(int n)
{
int count=0;
while(n>0)
{
count++;
n=n&(n-1);
}
return n;
}
int isIn(int *array,int n,int k)
{
for(int i=0;i<n;i++)
{
if(array[i]==k)
{
return 1;
}
}
return 0;
}
void solve()
{
int n;
scanf("%d",&n);
int *A=(int *)malloc(sizeof(int)*n);
arrayScan(A,n,0);
for(int i=0;i<n;i++)
{
if((A[i]&1)==1)
{
}
else
{
A[i]=A[i]-1;
}
}
for(int j=0;j<n;j++)
{
printf("%d ",A[j]);
}
printf("\n");
}
int main()
{
// int test;
// scanf("%d",&test);
// while(test>0)
// {
// solve();
// test--;
// }
solve();
return 0;
}
|
/* AUTHOR: AKASH JAIN
* EMAIL: akash19jain@gmail.com
* ID: akash19jain
* DATE: 18-03-2020 20:07:09
*/
// #include<algorithm>
// #include <bits/stdc++.h>
// using namespace std;
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<ctype.h>
#define SC1(x) scanf("%lld",&x)
#define SC2(x,y) scanf("%lld%lld",&x,&y)
#define SC3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z)
#define SCS(x) scanf("\n%s", x)
#define SCA(a,n) for(long long i=0;i<n;i++) scanf("%lld",&a[i]);
#define PF1(x) printf("%lld\n",x)
#define PF2(x,y) printf("%lld %lld\n",x,y)
#define PF3(x,y,z) printf("%lld %lld %lld\n",x,y,z)
#define PFA(a,n) for(long long i=0;i<n;i++) printf("%lld ",a[i]); printf("\n");
#define PFN printf("\n")
#define PFS(x) printf("%s\n",x)
#define REP(i,n) for(long long i=0;i<(n);++i)
#define FOR(i,a,b) for(long long i=(a);i<=(b);++i)
#define FORD(i,a,b) for(long long i=(a);i>=(b);--i)
#define WHILE(n) while(n--)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define ITOC(c) ((char)(((ll)'0')+c))
#define MID(s,e) (s+(e-s)/2)
#define SZ(a) strlen(a)
#define PI 3.1415926535897932384626433832795
#define DEB(x) printf("The value of \"%s\" is: %d\n",#x,x)
#define CASES ll t;SC1(t);while(t--)
#define ABS(a) ((a>0)?a:-(a))
#define SWAP(a,b) ll z=a;a=b;b=z
#define SWAPC(a,b) char z=a;a=b;b=z
#define FLSH fflush(stdout)
#define faster ios_base::sync_with_studio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long ll;
typedef unsigned long long ull;
const ll INF = 1<<29;
const ll MOD = 1000000007;
const ll FMOD = 998244353;
const ll MAX = 10000000005;
const ll MIN = -10000000005;
#define FILEIO(name) \ freopen(name".in", "r", stdin); \ freopen(name".out", "w", stdout);
int cmp(const void * a,const void * b);
long long maxv(long long a,long long b);
long long minv(long long a,long long b);
long long gcd(long long u,long long v);
long long digits(long long n);
bool ispoweroftwo(long long n);
bool isvowel(char x);
ll chartoint(char ch);
ll CEIL(ll x,ll y);
ll FLOOR(ll x,ll y);
int main()
{
#ifndef ONLINE_JUDGE
freopen("F:\\COMPETITIVE-PROGRAMMING\\inp.txt", "r", stdin);
freopen("F:\\COMPETITIVE-PROGRAMMING\\out.txt", "w", stdout);
#endif
ll n;
SC1(n);
ll x;
REP(i,n)
{
SC1(x);
if(x%2==0)
x--;
printf("%lld ",x);
}
return 0;
}
//qsort(arr,n,sizeof(arr[0]),cmp);
int cmp (const void * a, const void * b)
{
if( *(ll*)a - *(ll*)b < 0 ) return -1;
if( *(ll*)a - *(ll*)b > 0 ) return 1;
return 0;
}
long long maxv(long long a,long long b)
{
if(a>b) return a;
return b;
}
long long minv(long long a,long long b)
{
if(a<b) return a;
return b;
}
long long gcd(long long u,long long v)
{
if (v == 0) return u;
return gcd(v, u%v);
}
long long digits(long long n) //to calculate no of digits in a number
{
return floor(log10(n))+1;
}
bool ispoweroftwo(long long x)
{
return x && (!(x&(x-1)));
}
bool isvowel(char x)
{
return(x=='a' || x== 'e' ||x=='i' || x== 'o' || x=='u' );
}
ll chartoint(char ch)
{
if(ch>='A' && ch<='Z') return(ch-'A');
else if(ch>='0' && ch<='9') return (ch-'0');
else if(ch>='a' && ch<='z') return (ch-'a');
else return 0;
}
ll CEIL(ll x,ll y)
{
if(x%y==0) return(x/y);
else return(x/y +1);
}
ll FLOOR(ll x,ll y)
{
if(x%y==0) return(x/y);
else return(x/y -1);
}
|
#include <stdio.h>
int A[2222],B[2222],pre=-1,k,sum,n,i;
int cmp(void *a, void *b){ return A[*(int *)b] - A[*(int *)a];}
int cmpp(void *a, void *b){ return *(int *)a - *(int *)b;}
int main(){
for(scanf("%i%i",&n,&k);i<n;i++)
scanf("%i",&A[i]), B[i]=i;
qsort(B, n, sizeof(int), cmp);
for(i=0;i<k;i++) sum+=A[B[i]];
printf("%i\n", sum);
qsort(B, k, sizeof(int), cmpp);
for(i=0;i<k-1;i++)
printf("%i ", B[i]-pre), pre=B[i]; printf("%i\n", n-pre-1);
}
|
#include<stdio.h>
#include<stdlib.h>
int cmp0(int *x,int*y){
if(x[0]>y[0])return 1;
return -1;
}
int cmp1(int *x,int*y){
if(x[1]>y[1])return 1;
return -1;
}
int a[3000][2];
int main() {
int n,k,i,sum;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)scanf("%d",&a[i][0]),a[i][1]=i;
qsort(a+1,n,sizeof(a[0]),cmp0);
for(sum=0,i=n-k+1;i<=n;i++)sum+=a[i][0];
printf("%d\n",sum);
qsort(a+n-k+1,k,sizeof(a[0]),cmp1);
a[n-k][1]=0;
for(i=n-k+1;i<=n;i++){
if(i==n) printf("%d",n-a[n-1][1]);
else printf("%d ",a[i][1]-a[i-1][1]);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
long long x[10000], t[10000];
int main()
{
long long n, k, i, p, a, w;
scanf("%I64d%I64d", &n, &k);
for(i=0; i<n; i++)
{
scanf("%I64d", &x[i]);
t[x[i]]++;
}
a=k;
w=0;
for(i=3000; i>=0; i--)
{
k-=t[i];
if(k<0){t[i]+=k;k=0;}
w+=t[i]*i;
}
printf("%I64d\n", w);
p=-1;
for(i=0; a>1; i++)
{
if(t[x[i]]>0){t[x[i]]--; a--; printf("%I64d ", i-p); p=i;}
}
printf("%I64d", n-p-1);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#define N 2009
unsigned ks[N];
unsigned as[N];
int indircmp(const void* a, const void* b){
return as[*(unsigned*)b] - as[*(unsigned*)a];
}
int cmp(const void* a, const void* b){
return *(unsigned*)a - *(unsigned*)b;
}
int main(){
unsigned i,n,k,max;
scanf("%u%u", &n, &k);
for(i=0;i<n;i++){
scanf("%u", as+i);
ks[i]=i;
}
qsort(ks, n, sizeof(unsigned), indircmp);
qsort(ks, k, sizeof(unsigned), cmp);
max=0;
for(i=0;i<k;i++)
max+=as[ks[i]];
printf("%u\n", max);
ks[0]=0;
for(i=1;i<k;i++){
printf("%u ", ks[i]-ks[i-1]);
}
printf("%u", n-ks[k-1]);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int main()
{ int n,i,j,l,c,ind,x,s,M,k;
scanf("%d %d",&n ,&k);
int T[n];
int A[k];
for (i=0;i<n;i++){
scanf("%d",&x);
T[i]=x;
}
s=0; l=1;
for (j=0;j<k;j++){
M=T[0];
ind=0;
for (i=1;i<n;i++){
if (T[i]>M) {
M=T[i];
ind=i;
}
}
T[ind]=0;
s=s+M;
A[k-l]=M;
l++;
}
printf("%d\n",s);
c=0;
j=-1;
if (k!=1){
for (i=0;i<n;i++){
if (c<k-1){
if (T[i]==0) {
c++;
printf("%d ",i-j);
j=i;
}
}
}
printf("%d",n-1-j);
}
else {
printf("%d",n);
}
}
|
#include <stdio.h>
#include <stdlib.h>
#define N 2000
int a[N + 1], b[N + 1], t[N + 1];
int compare (void const *a, void const *b) {
int ia = *(int *) a;
int ib = *(int *) b;
return ib - ia;
}
int main () {
int n, k, i, j, p, c, s, tt;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
qsort(b, n, sizeof *b, compare);
p = c = 0;
for (i = 0; i < k; i++) {
p += b[i];
}
printf("%d\n", p);
c = s = 0, tt = 1;
for (i = 0; i < n && tt < k; i++) {
++c;
for (j = 0; j < k; j++) {
if (a[i] == b[j]) {
b[j] = -1;
printf("%d ", c);
s += c;
c = 0;
++tt;
break;
}
}
}
printf("%d\n", n - s);
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int arr[2000], ind[2000];
int cmp(const void *a, const void *b) {
const int *ai = a, *bi = b;
return arr[*bi]-arr[*ai];
}
int ind_cmp(const void *a, const void *b) {
const int *ai = a, *bi = b;
return *ai - *bi;
}
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
ind[i] = i;
scanf("%d", &arr[i]);
}
qsort(ind, n, sizeof(*ind), cmp);
qsort(ind, k, sizeof(*ind), ind_cmp);
int sum = 0;
for (int i = 0; i < k; i++) {
sum += arr[ind[i]];
}
printf("%d\n", sum);
int cur = 0;
for (int i = 0; i < k-1; i++) {
printf("%d ", ind[i]-cur + 1);
cur += ind[i]-cur +1;
}
printf("%d\n", n-cur);
}
|
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
void shift(int *a, int *b, int n, int c)
{
int i;
for (i = 1; i <= n; i++)
{
a[i-1] = a[i];
b[i-1] = b[i];
}
a[n] = c;
return;
}
int main(void)
{
int n, k, a[2003], t[2003] = {0}, m[2003] = {0};
int i, j;
scanf("%d%d", &n, &k);
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
for (j = k-1; j >= 0; j--)
if (a[i] > m[j]){
shift(m, t, j, a[i]);
t[j] = i;
break;
}
}
for (i = 0; i < k; i++)
{
for (j = k-1; j > i; j--)
{
if (t[j] < t[j-1])
{
int tmp = t[j];
t[j] = t[j-1];
t[j-1] = tmp;
}
}
}
int ans = 0;
for (i = 0; i < k; i++)
{
ans += m[i];
}
printf("%d\n", ans);
t[k] = n;
printf("%d ", t[1]);
for (i = 2; i <= k; i++)
{
printf("%d ", t[i] - t[i-1]);
}
printf("\n");
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
typedef struct data{
int a;
int idx;
}data;
int cmp(const void *r,const void *s)
{
data *c = (data *)r;
data *d = (data *)s;
return d->a - c->a;
}
int max(int a,int b)
{
if(a>b)
return a;
return b;
}
int min(int a,int b)
{
if(a<b)
return a;
return b;
}
int mod(int a)
{
if(a<0)
return -a;
return a;
}
data p[100004];
int main()
{
int n,k;
scanf("%d%d",&n,&k);
int i,j=0;
for(i=1;i<=n;i++)
{
scanf("%d",&p[i].a);
p[i].idx=i;
}
qsort(p+1,n,sizeof(data),cmp);
int ans=0,count[20004]={0};
for(i=1;i<=k;i++)
{
ans+=p[i].a;
}
printf("%d\n",ans );
for(i=1;i<=k;i++)
{
count[p[i].idx]=1;
}
int start=1,q[100004];
j=0;
for(i=1;i<=n;i++)
{
if(count[i]==1)
{
q[j++]=i-start+1;
start=i+1;
}
}
q[j-1]+=(n-start+1);
for(i=0;i<j;i++)
{
printf("%d ",q[i] );
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int tab1 [2001];
int tab2 [2001];
int tab3 [2001];
//prepisano
//tuki sm zdj zamenjala da gre od najvecjega do najmansega
int cmpfunc (const void * a, const void * b) {
return ( *(int*)b - *(int*)a );
}
int main (){
int n;
int a;
scanf ("%d", &n);
scanf ("%d", &a);
for ( int i = 0; i < n; i++){
scanf ("%d", &tab1[i]);
}
//kopiram tabelo
memcpy(tab2, tab1, sizeof(tab1));
//prepisano
qsort(tab2, n, sizeof(int), cmpfunc);
int vsota = 0;
for (int i = 0; i < a; i++){
vsota += tab2[i];
}
printf("%d\n",vsota );
int s = 1;
for (int i = 0; i < n; i++){
for (int j = 0; j < a; j++){
if (tab1[i] == tab2[j]){
tab2[j] = -1;
tab3[s] = i + 1;
s++;
break;
}
}
}
tab3[s-1]= n;
/*
for (int i = 0; i <= s; i++){
printf("%d \n",tab3[i] );
}
*/
for (int i = 1 ; i < s; i++){
printf("%d ", tab3[i] -tab3[i-1]);
}
return 0;
}
|
#include<stdio.h>
int main()
{
int i,j,n,k,l=0,profit=0,sum=0,a[2002],b[2002] ,index[2002];
scanf("%d%d",&n,&k);
for(i=0 ; i<n ; i++) { scanf("%d",&a[i]); b[i]=a[i] ; }
for(i=0 ; i<n-1 ; i++)
for(j=0 ; j<n-1-i ; j++)
if(a[j]<a[j+1]) {int temp = a[j] ; a[j] = a[j+1] ; a[j+1] = temp ;}
for(i=0 ; i<k ; i++) profit += a[i] ;
for(i=0 ; i<n ; i++)
for(j=0 ; j<n ; j++)
if(a[i]==b[j]) {index[l++] = j ; b[j]=0 ; j=n+1 ; }
for(i=0 ; i<k ; i++)
for(j=0 ; j<k-1-i ; j++)
if(index[j] > index[j+1]) {int temp = index[j] ; index[j] = index[j+1] ; index[j+1] = temp ;}
printf("%d\n",profit);
for(i=0 ; i<k ; i++)
{
if(i==k-1) printf("%d\n", n-sum ) ;
else if (i==0) { printf("%d ", index[i]+1); sum += index[i] + 1 ; }
else {printf("%d ", index[i]-index[i-1]) ; sum += index[i] - index[i-1] ;}
}
}
|
#include <stdio.h>
int a[2001],num[2001];
void qs1(int l,int r){
int i,j,mid,temp;
i=l;
j=r;
mid=a[(i+j)/2];
while (i<j) {
while (a[i]>mid) i++;
while (a[j]<mid) j--;
if (i<=j) {
temp=a[i]; a[i]=a[j]; a[j]=temp;
temp=num[i]; num[i]=num[j]; num[j]=temp;
i++; j--;
}
}
if (i<r) qs1(i,r);
if (j>l) qs1(l,j);
}
void qs2(int l,int r){
int i,j,mid,temp;
i=l;
j=r;
mid=num[(i+j)/2];
while (i<j) {
while (num[i]<mid) i++;
while (num[j]>mid) j--;
if (i<=j) {
temp=a[i]; a[i]=a[j]; a[j]=temp;
temp=num[i]; num[i]=num[j]; num[j]=temp;
i++; j--;
}
}
if (i<r) qs2(i,r);
if (j>l) qs2(l,j);
}
main(){
int n,k,i,temp,ans=0;
scanf("%d%d",&n,&k);
for (i=1;i<=n;i++){
scanf("%d",&a[i]);
num[i]=i;
}
qs1(1,n);
qs2(1,k);
for (i=1;i<=k;i++) ans+=a[i];
printf("%d\n",ans);
num[0]=0; num[k]=n;
for (i=1;i<=k;i++) printf("%d ",num[i]-num[i-1]); putchar('\n');
}
|
#include <stdio.h>
#include <stdlib.h>
struct problem
{
int number;
int index;
};
struct problem p[3000];
int pt(void *p1,void*p2)
{
struct problem *a=(struct problem *)p1;
struct problem *b=(struct problem *)p2;
return (b->number - a->number);
}
int t(void *p1,void *p2)
{
struct problem *a=(struct problem*)p1;
struct problem *b=(struct problem *)p2;
return a->index-b->index;
}
int main()
{
int sum=0,sum1=0;
int n,k;
scanf("%d",&n);
scanf("%d",&k);
int i;
int z;
for(i=0;i<n;i++)
{
p[i].index=i;
scanf("%d",&p[i].number);
}
qsort(p,n,sizeof(struct problem),pt);
for(i=0;i<k;i++)
{
sum=sum+p[i].number;
}
printf("%d\n",sum);
if(k==1)
printf("%d",n);
else{
qsort(p,k,sizeof(struct problem),t);
printf("%d ",p[0].index+1);
sum1=p[0].index+1;
for(i=1;i<k-1;i++)
{
z=p[i].index-p[i-1].index;
printf("%d ",z);
sum1=sum1+z;
}
printf("%d",n-sum1);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n,k;
scanf("%d%d",&n,&k);
int b[n];
int c[n];
int a[n];
int temp=0;int r=0;
int sum=0;int p=0;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=0;
c[i]=a[i];
}int q=0;int csum=0;
for(int i=0;i<n;i++)
{
for(int j=1;j<n;j++)
{
if(a[j]<a[j-1])
{
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
}
for(int i=n-1;i>=n-k;i--)
{
b[r]=a[i];
r=r+1;
sum=sum+a[i];
}printf("%d\n",sum);
for(int i=0;i<n;i++)
{
for(int j=0;j<r;j++)
{
if(c[i]==b[j])
{
c[i]=0;
b[j]=0;
}
}
}
for(int i=0;i<n;i++)
{
p=p+1;
if(c[i]==0)
{
q=q+1;
if(q!=r)
{
csum=csum+p;
printf("%d ",p);
p=0;
}
else{
n=n-csum;
printf("%d ",n);
}
}
}
return 0;
}
|
#include<stdio.h>
void i_sort(int a[],int b,int c[]){
int i,j,temp;
for(i=1;i<b;i++){
for(j=i;j>0&&a[j]>a[j-1];j--){
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
temp=c[j];
c[j]=c[j-1];
c[j-1]=temp;
}
}
}
void i2_sort(int a[],int b){
int i,j,temp;
for(i=1;i<b;i++){
for(j=i;j>0&&a[j]<a[j-1];j--){
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
}
}
}
int main()
{
int a,b,i,sum=0;
scanf("%d%d",&a,&b);
int ar[a],br[a];
for(i=0;i<a;i++){
scanf("%d",&ar[i]);
br[i]=i+1;
}
i_sort(ar,a,br);
for(i=0;i<b;i++){
sum+=ar[i];
}
printf("%d\n",sum);
i2_sort(br,b);
if(b==1){
printf("%d\n",a);
}
else{
printf("%d ",br[0]);
for(i=1;i<b-1;i++){
printf("%d ",br[i]-br[i-1]);
}
printf("%d\n",a-br[b-2]);
}
return 0;
}
|
#include<stdio.h>
int main(){
int n,k,t,i,j,temp,s=0,s1=0,c=0;
scanf("%d\t%d",&n,&k);
int arr[n],arr1[n],arr2[n];
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
arr2[i]=i;
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++)
{
if(arr[i]<arr[j])
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
temp=arr2[i];
arr2[i]=arr2[j];
arr2[j]=temp;
}
}
}
for(i=0;i<k-1;i++)
for(j=i+1;j<k;j++)
{
if(arr2[i]>arr2[j])
{
temp=arr2[i];
arr2[i]=arr2[j];
arr2[j]=temp;
}
}
for(i=0;i<k;i++)
{
s+=arr[i];
}
printf("%d\n",s);
if(k==1)
{
printf("%d\t",n);
}
else{
arr2[k-1]=n-1;
printf("%d ",arr2[0]+1);
for(i=1;i<k;i++)
{
printf("%d ",arr2[i]-arr2[i-1]);
}
}
return 0;
}
|
#include <stdio.h>
int main()
{
int n,k;
scanf("%d %d",&n,&k);
int number[n];
int i,j;
for(i=0;i<n;i++)
{
scanf("%d",&number[i]);
}
int ne[k];
int wei[k];
// if(k==1)
// printf()
int out=0;
int a,we;
for(i=0;i<k;i++)
{
a=number[0];
wei[i]=0;
for(j=1;j<n;j++)
{
if(number[j]>a)
{
a=number[j];
wei[i]=j;
}
}
ne[i]=a;
number[wei[i]]=0;
} //现在得到 了k个最大值和这k个最大值所在的位置
// for(i=0;i<k;i++)
// printf("%d\t%d\t",wei[i],ne[i]);
for(i=0;i<k;i++)
{
out+=ne[i];
}
printf("%d\n",out);
for(i=0;i<k-1;i++)
{
for(j=0;j<k-1;j++)
{
if(wei[j+1]<wei[j])
{
we=wei[j+1];
wei[j+1]=wei[j];
wei[j]=we;
}
}
}//对排位进行冒泡排序
// for(i=0;i<k;i++)
// printf("%d\t%d\t",wei[i],ne[i]);
if(k==1)
printf("%d\n",n);
if(k==2)
printf("%d %d\n",wei[0]+1,n-1-wei[0]);
if(k>2)
{
printf("%d ",wei[0]+1);
for(i=1;i<k-1;i++)
{
printf("%d ",wei[i]-wei[i-1]);
}
printf("%d\n",n-1-wei[k-2]);
}
}
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int N,n,i,Sum=0,Max=0,maxTemp,count=0,c;
scanf("%d",&N);
int arr[N];
scanf("%d",&n);
int index[n];
c=n;
for(i=0;i<N;i++){
scanf("%d",&arr[i]);
}
//ѡ������n����������dz�����λ�á�
while(c>0){
Max=0;
for(int i=0;i<N;i++){
if(arr[i]>Max){
Max=arr[i];
maxTemp=i;
}
}
index[count]=maxTemp;
//printf("%d ",maxTemp);
arr[maxTemp]=0;
count++;
Sum+=Max;
//printf("%d\n",Max);
c--;
}
printf("%d\n",Sum);
int cmp ( const void *a , const void *b ){
return *(int *)a - *(int *)b;
}
qsort(index,n,sizeof(index[0]),cmp);
//sort(index,index+n);
if(n>1){
printf("%d ",index[1]);
for(i=1;i<n-1;i++){
printf("%d ",index[i+1]-index[i]);
}
printf("%d ",N-index[n-1]);
}
else{
printf("%d",N);
}
// printf("Hello world!\n");
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int compare(void *pa, void *pb)
{
int *p1=pa;
int *p2=pb;
return *p2-*p1;
}
int main()
{
int N,M,i,j,k,a,b,c,d,x,y,z,t,temp;
long long int s;
int A[10000],B[10000],C[10000],D[10000],E[10000];
scanf("%d %d", &N, &M);
for(i=0; i<N; i++)
{
scanf("%d", &A[i]);
B[i]=A[i];
}
qsort(B,N,sizeof(int),compare);
// for(i=0; i<N; i++)
// {
// printf("%d ", B[i]);
// }
// printf("\n");
s=0;
for(i=0; i<M; i++)
{
C[i]=B[i];
s=s+C[i];
}
z=0;
for(i=0; i<N; i++)
{
for(j=0; j<M; j++)
{
if(A[i]==C[j])
{
D[z]=i+1;
z++;
C[j]=-100;
break;
}
}
}
if(M>1)
{
E[0]=D[0];
for(i=1; i<(M-1); i++)
{
E[i]=D[i]-D[i-1];
}
E[i]=N-D[i-1];
}
else
{
E[0]=N;
}
printf("%lld\n",s);
for(i=0; i<M; i++)
{
printf("%d ", E[i]);
}
printf("\n");
return 0;
}
|
#include<stdio.h>
void swap(int *a,int *b)
{
int temp;
temp=*a;
*a=*b;
*b=temp;
}
int partition(int a[],int low,int high)
{
int pivot=a[high];
int i=low-1,j=low;
for(;j<=high-1;j++)
{
if(a[j]<=pivot)
{
i++;
swap(&a[i],&a[j]);
}
}
swap(&a[i+1],&a[high]);
return i+1;
}
void quicksort(int a[],int low,int high)
{
if(low<high){
int i;
i=partition(a,low,high);
quicksort(a,low,i-1);
quicksort(a,i+1,high);
}
}
int main()
{
int n,k,sum=0;
scanf("%d%d",&n,&k);
int a[n],b[n];
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
int pivot=a[0];
int low=0,high=n-1;
quicksort(a,low,high);
for(int i=n-1;i>n-1-k;i--)
sum=sum+a[i];
int c=0,j,o=0;
printf("%d\n",sum);
sum=0;
for(int i=0;i<n;i++)
{
for(j=n-1;j>n-k-1;j--)
{
if(b[i]==a[j])
{
o++;
if(o>=k)
break;
c++;
sum=sum+c;
printf("%d ",c);
c=0;
a[j]=0;
break;
}
}
if(j==n-k-1)
c++;
if(o>=k)
break;
}
printf("%d",n-sum);
}
|
#include<stdio.h>
long long n,k,i,j,max,ans,take,care,fre[100000],arr[100000],count,ind[100000];
int main()
{
scanf("%lld %lld",&n,&k);
max=0;
for(i=0;i<n;i++)
{
scanf("%lld",&arr[i]);
if(arr[i]>max)
{
max=arr[i];
}
fre[arr[i]]++;
}
count=0;
while(count<k)
{
for(i=max;i>=1;i--)
{
if(fre[i]>0)
{
for(j=0;j<n;j++)
{
if(arr[j]==i && ind[j]==0)
{
ans=ans+i;
count++;
ind[j]=1;
fre[i]--;
// printf("ans is as %lld %lld\n",i,j);
break;
}
}
break;
}
}
}
/* for(i=0;i<n;i++)
{
printf("%lld ",ind[i]);
}
printf("\n");*/
printf("%lld\n",ans);
take=0;
care=0;
count=0;
for(i=0;i<n;i++)
{
if(ind[i]==1)
{
if(care==k-1)
{
printf("%lld ",n-1-i+count+1);
break;
}
count++;
printf("%lld ",count);
count=0;
care++;
}
else
{
count++;
}
}
}
|
#include <stdio.h>
#include <stdlib.h>
typedef struct{
int pos;
int val;
}problem;
int cmp1(const void *a, const void *b) {
return (*(problem *)a).val - (*(problem*)b).val ;
}
int cmp2(const void *a, const void *b) {
return (*(problem *)a).pos - (*(problem*)b).pos ;
}
int main (void)
{
problem list[2001];
int n;
int k;
problem *max;
while(scanf("%d %d", &n, &k)!=EOF){
int i = 0;
int j = 0;
int sum = 0;
for(i = 0; i < n; i++){
scanf("%d",&list[i].val);
list[i].pos = i+1;
}
max = (problem*)malloc(sizeof(problem)*k);
int count = 0;
for(i = 0; i < n; i++){
if(count < k){
max[count].pos = list[count].pos;
max[count].val = list[count].val;
count++;
}
else{
qsort(max,k,sizeof(problem),cmp1);
for(j = 0; j < k; j++){
if(list[i].val>=max[j].val){
max[j].val = list[i].val;
max[j].pos = list[i].pos;
break;
}
}
}
}
qsort(max,k,sizeof(problem),cmp2);
for(j = 0; j < k; j++){
sum = sum + max[j].val;
}
max[k-1].pos = n;
for(j = k-1; j >= 1; j--){
max[j].pos = max[j].pos - max[j-1].pos;
}
printf("%d\n", sum);
for(i = 0; i < k; i++){
printf("%d ", max[i].pos);
}
}
}
|
#include <stdio.h>
main(){
int i, j, n, k, t, l= 0, m= 0, p= 0, s= 0, sum= 0, p_1= 1;
scanf("%i%i", &n, &k);
int a_n[n], h_k[k], p_k[k], du[n], pos[k];
for(i=0; i<n; ++i){
scanf("%i", &a_n[i]);
du[i]= a_n[i];
}
if(n==1){
printf("%i\n%i", a_n[0], n);
return 0;
}
else if(n==k){
for(i=0; i<n; ++i){
sum= sum+ a_n[i];
}
printf("%i\n", sum);
for(i=0; i<n; ++i){
printf("%i ", p_1);
}
return 0;
}
else{
for(i=0; i<n-1; ++i){
for(j=i; j<n; ++j){
if(a_n[i]<=a_n[j]){
t= a_n[i];
a_n[i]= a_n[j];
a_n[j]= t;
}
}
h_k[l++]= a_n[i];
sum= sum+a_n[i];
if(l== k)
break;
}
printf("%i\n", sum);
for(i=0; i<k; ++i){
for(j=0; j<n; ++j){
if(h_k[i]==du[j]){
du[j]= 0;
p_k[m++]=j+1;
break;
}
}
}
for(i=0; i<k-1; ++i){
for(j=i; j<k; ++j){
if(p_k[i]>=p_k[j]){
t= p_k[i];
p_k[i]= p_k[j];
p_k[j]= t;
}
}
}
for(i=0; i<k; ++i){
pos[i]= p_k[i]-p;
p= p_k[i];
s= s+pos[i];
if(i== k-1 && s<n){
pos[i]= pos[i]+(n-p_k[i]);
}
printf("%i ", pos[i]);
}
}
}
|
#include <stdio.h>
#include <stdlib.h>
void k_biggest(int n, int k, int problems[], int biggest[]) {
int aux_arr[n][2], swap[2];
for (int i = 0; i < n; i++) {
aux_arr[i][0] = i;
aux_arr[i][1] = problems[i];
}
for (int i = 0; i < k; i++) {
biggest[i] = aux_arr[i][0];
for (int j = i; j < n; j++) {
if (aux_arr[i][1] < aux_arr[j][1]) {
biggest[i] = aux_arr[j][0];
swap[0] = aux_arr[j][0];
swap[1] = aux_arr[j][1];
aux_arr[j][0] = aux_arr[i][0];
aux_arr[j][1] = aux_arr[i][1];
aux_arr[i][0] = swap[0];
aux_arr[i][1] = swap[1];
}
}
}
}
int cmp(const void *item1, const void *item2) {
int int1 = *((int *) item1), int2 = *((int *) item2);
if (int1 < int2) return -1;
else if (int1 > int2) return 1;
return 0;
}
int main() {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
int problems[n], biggest[k];
for (int i = 0; i < n; i++)
scanf("%d", problems + i);
k_biggest(n, k, problems, biggest);
int total_profit = 0;
int problems_day[k];
qsort(biggest, k, sizeof(int), cmp);
for (int i = 0; i < k; i++) {
total_profit += problems[biggest[i]];
if (k == 1)
problems_day[i] = n;
else
if (i == 0)
problems_day[i] = biggest[i] + 1;
else if (i + 1 == k)
problems_day[i] = biggest[i] - biggest[i-1] + ((n - 1) - biggest[i]);
else
problems_day[i] = biggest[i] - biggest[i-1];
}
printf("%d\n", total_profit);
for (int i = 0; i < k; i++) printf("%d ", problems_day[i]);
printf("\n");
}
|
#include<stdio.h>
#define N 2001
#include<stdlib.h>
int compare(const void *a,const void *b){
return *(int *)b-*(int *)a;
}
void sort(int *a,int n){
qsort(a,n,sizeof(int),compare);
}
int main(){
int n,k;
scanf("%d%d",&n,&k);
int a[N];
int b[N];
int i,j;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b,n);
/*
for(i=0;i<n;i++){
printf(" %d",a[i]);
}
printf("\n");
for(i=0;i<n;i++){
printf(" %d",b[i]);
}
printf("\n");
*/
int left[N];
int right[N];
int who[N];
char see[N];
for(i=0;i<n;i++){
who[i]=n;
see[i]=0;
}
for(i=0;i<k;i++){
for(j=0;j<n;j++){
if(!see[j] && b[i]==a[j]){
see[j]=1;
left[i]=j;
right[i]=j;
who[j]=i;
break;
}
}
}
for(i=0;i<k;i++){
while(left[i]-1>=0 && who[left[i]-1]==n){
who[left[i]-1]=i;
left[i]--;
}
while(right[i]+1<n && who[right[i]+1]==n){
who[right[i]+1]=i;
right[i]++;
}
}
/*
for(i=0;i<n;i++){
printf(" %d",i);
}
printf("\n");
for(i=0;i<n;i++){
printf(" %d",a[i]);
}
printf("\n");
for(i=0;i<n;i++){
printf(" %d",who[i]);
}
printf("\n");
*/
int total_profit=0;
for(i=0;i<k;i++){
total_profit+=b[i];
}
printf("%d\n",total_profit);
int number[N];
int num=0;
i=0;
while(i<n){
j=i;
while(j+1<n && who[j+1]==who[i]){
j++;
}
number[num]=j-i+1;
num++;
i=j+1;
}
for(i=0;i<num;i++){
printf(" %d",number[i]);
}
printf("\n");
return 0;
}
|
#include<stdio.h>
void quicksort1(int *ar,int left,int right);
void quicksort2(int *ar,int left,int right);
int main(void)
{
int n,k;
int i;
int arr[2005],arr2[2005],maxpos[2005];
scanf("%d %d",&n,&k);
for(i=0;i<n;i++){
scanf("%d",&arr[i]);
arr2[i]=arr[i];
}
quicksort1(arr2,0,n-1);
int count=0;
while(count<k){
for(i=0;i<n;i++){
if(arr[i]==arr2[count]){
arr[i]=0;
maxpos[count]=i;
break;
}
}
count++;
}
quicksort2(maxpos,0,k-1);
// {
// printf("\n*******\n");
// for(i=0;i<k;i++){
// printf("%d ",maxpos[i]);
// }
// printf("\n*******\n");
// }
long long sum=0;
for(i=0;i<k;i++){
sum+=arr2[i];
}
printf("%lld\n",sum);
for(i=1;i<=k;i++){
if(k==1){
printf("%d\n",n);
break;
}
if(i==1){
printf("%d",maxpos[i]);
}
else if(i==k){
printf("%d",n-maxpos[i-1]);
}
else{
printf("%d",maxpos[i]-maxpos[i-1]);
}
putchar((i==k)?'\n':' ');
}
return 0;
}
void quicksort1(int *ar,int left,int right)//�Ӵ�С
{
if(left>=right)
return;
int std=ar[left],i=left,j=right;
while(i<j){
while(ar[j]<=std&&i<j)
j--;
ar[i]=ar[j];
while(ar[i]>=std&&i<j)
i++;
ar[j]=ar[i];
}
ar[j]=std;
quicksort1(ar,left,j-1);
quicksort1(ar,j+1,right);
}
void quicksort2(int *ar,int left,int right)//������
{
if(left>=right)
return;
int std=ar[left],i=left,j=right;
while(i<j){
while(ar[j]>=std&&i<j)
j--;
ar[i]=ar[j];
while(ar[i]<=std&&i<j)
i++;
ar[j]=ar[i];
}
ar[j]=std;
quicksort2(ar,left,j-1);
quicksort2(ar,j+1,right);
}
|
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<stdbool.h>
#define lli long long int
int cmp(const void *a,const void*b)
{
return *(lli*)b-*(lli*)a;
}
int cmp1(const void *a,const void*b)
{
return *(lli*)a-*(lli*)b;
}
int main()
{
lli n,k,i,j,res=0,count,search,ktemp,temps;
scanf("%lld %lld",&n,&k);
ktemp=k;
lli a[n],pos[k],max[k],temp[n];
for(i=0;i<n;i++)
scanf("%lld",a+i);
for(i=0;i<n;i++)
temp[i]=a[i];
qsort(temp,n,sizeof(temp[0]),cmp);
/* printf("a-descending \n");
for(i=0;i<n;i++)
printf("%lld ",temp[i]);
printf("\n");*/
for(i=0;i<k;i++)
{
max[i]=temp[i];
res+=max[i];
}
printf("%lld\n",res);
/* printf("max\n");
for(i=0;i<ktemp;i++)
printf("%lld ",max[i]);
printf("\n");*/
count=0;
while(k>0)
{
search=max[count];
for(j=0;j<n;j++)
{
if(search==a[j])
{
pos[count]=j;
a[j]=0;
break;
}
}
count+=1;
k-=1;
}
qsort(pos,ktemp,sizeof(pos[0]),cmp1);
/* printf("positions ascending\n");
for(i=0;i<ktemp;i++)
printf("%lld ",pos[i]);
printf("\n");*/
if(ktemp>1)
printf("%lld ",pos[0]+1);
for(i=1;i<ktemp-1;i++)
{
temps=pos[i]-pos[i-1];
printf("%lld ",temps);
}
if(ktemp>1)
printf("%lld ",n-pos[ktemp-2]-1);
else
printf("%lld",n);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <malloc.h>
#include <math.h>
#include <ctype.h>
#include <limits.h>
//MaxHeap INT_MAX
#define MINDATA INT_MIN
struct DataDetail
{
int Index;
int Val;
};
typedef struct DataDetail ElementType;
struct MinHeap
{
int TotalCapacity;
int CurrentSize;
ElementType *HeapData;
};
struct MinHeap *MinHeapInit(int TotalCapa)
{
struct MinHeap *Heap;
Heap = malloc(sizeof(struct MinHeap));
Heap -> HeapData = malloc((TotalCapa+3)*sizeof(ElementType));
Heap -> HeapData[0].Val = MINDATA;
Heap -> TotalCapacity = TotalCapa;
Heap -> CurrentSize = 0;
return Heap;
}
int MinHeapIsEmpty(struct MinHeap *Heap)
{
return (Heap -> CurrentSize == 0);
}
int MinHeapIsFull(struct MinHeap *Heap)
{
return (Heap -> CurrentSize == Heap -> TotalCapacity);
}
int MakeMinHeapEmpty(struct MinHeap *Heap)
{
Heap -> TotalCapacity = Heap -> CurrentSize = 0;
free(Heap -> HeapData);
Heap -> HeapData = NULL;
return 0;
}
int MinHeapDestroy(struct MinHeap *Heap)
{
MakeMinHeapEmpty(Heap);
free(Heap);
Heap = NULL;
return 0;
}
//if Heap is full,return 1
int MinHeapInsert(struct MinHeap *Heap,ElementType ToBeInsert)
{
int i;
if(MinHeapIsFull(Heap))
{
return 1;
}
//MaxHeap <
for(i = ++Heap->CurrentSize; Heap->HeapData[i/2].Val > ToBeInsert.Val; i /= 2)
{
Heap -> HeapData[i] = Heap -> HeapData[i/2];
}
Heap -> HeapData[i] = ToBeInsert;
return 0;
}
//if Heap is Empty,return MINDATA
ElementType MinHeapDeleteMin(struct MinHeap *Heap)
{
int i;
int Child;
ElementType MinimumElement,LastElement;
if(MinHeapIsEmpty(Heap))
{
return Heap -> HeapData[0];
}
MinimumElement = Heap -> HeapData[1];
LastElement = Heap -> HeapData[Heap -> CurrentSize --];
for(i = 1; i*2 <= Heap->CurrentSize; i = Child)
{
//Find smaller child
Child = i*2;
//MaxHeap >
if(Child != Heap->CurrentSize && Heap->HeapData[Child+1].Val < Heap->HeapData[Child].Val)
{
Child ++;
}
//MaxHeap <
if(LastElement.Val > Heap -> HeapData[Child].Val)
{
Heap -> HeapData[i] = Heap -> HeapData[Child];
}
else
{
break;
}
}
Heap -> HeapData[i] = LastElement;
return MinimumElement;
}
//if Heap is Empty,return MINDATA
ElementType MinHeapFindMin(struct MinHeap *Heap)
{
if(MinHeapIsEmpty(Heap))
{
return Heap -> HeapData[0];
}
return Heap -> HeapData[1];
}
int CmpStruction(const void *a,const void *b)
{
ElementType *c = (ElementType*)a;
ElementType *d = (ElementType*)b;
return c->Index - d-> Index;
}
int main()
{
int N,part;
int i,j;
int input[4000];
while(~scanf("%d %d",&N,&part))
{
for(i = 0; i < N; i ++)
{
scanf("%d",&input[i]);
}
struct MinHeap *Heap = MinHeapInit(part);
for(i = 0; i < N; i ++)
{
ElementType Tmp;
Tmp.Val = input[i];
Tmp.Index = i;
if(!MinHeapIsFull(Heap))
{
MinHeapInsert(Heap,Tmp);
}
else if(MinHeapIsFull(Heap)&&Tmp.Val>MinHeapFindMin(Heap).Val)
{
MinHeapDeleteMin(Heap);
MinHeapInsert(Heap,Tmp);
}
}
ElementType result[4000];
int resultend = 0;
while(!MinHeapIsEmpty(Heap))
{
ElementType HeapMin = MinHeapFindMin(Heap);
MinHeapDeleteMin(Heap);
result[resultend++] = HeapMin;
}
qsort(result,resultend,sizeof(result[0]),CmpStruction);
int sumsum = 0;
for(i = 0; i < resultend; i ++)
{
sumsum += result[i].Val;
}
printf("%d\n",sumsum);
// for(i = 0;i < resultend;i++)printf("%d ",result[i].Index);
int minus_1 = N;
int minus_2 = N;
result[resultend].Index = N;
for(j = 0; j < resultend; j ++)
{
minus_1 = result[j].Index;
minus_2 = result[j+1].Index;
if(j==resultend-1 && j==0)
{
printf("%d\n",N);
break;
}
else if(j==resultend-1)
{
printf("%d\n",minus_2-minus_1);
break;
}
else if(j==0)
{
printf("%d ",minus_2);
continue;
}
printf("%d ",minus_2-minus_1);
}
}
return 0;
}
|
#include <stdio.h>
int d[200001];
int n;
int main() {
long long max_sum = 0;
long long l_sum = 0, r_sum = 0;
int i, j;
scanf("%d", &n);
for(i=0 ; i < n ; i++)
scanf("%d", &d[i]);
i = 0; j = n-1;
while(i <= j) {
if(l_sum <= r_sum)
l_sum += d[i++];
else
r_sum += d[j--];
if(l_sum == r_sum)
max_sum = l_sum;
}
printf("%lld\n", max_sum);
return 0;
}
|
#include<stdio.h>
int main()
{
long long int s1=0, s2=0, x=0;
int i, n, c, r;
scanf("%lld", &n);
int a[n+1];
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
c=0;
r=n-1;
while(c<=r)
{
if(s1>=s2)
{
s2+=a[r];
r--;
}
else
{
s1+=a[c];
c++;
}
if(s1==s2 && s1>=x)
{
x=s1;
}
}
printf("%lld", x);
return 0;
}
|
#include <stdio.h>
long long int arr[1000007];
int main()
{
long long int n,i,l,r,suml=0,sumr=0,m=0;
scanf("%lld",&n);
for(i=0;i<n;i++)
{
scanf("%lld",&arr[i]);
}
suml=0;
sumr=0;
l=-1;r=n;
while(l<r)
{
if(suml==sumr)
{
m=suml;
suml+=arr[++l];
sumr+=arr[--r];
}
else if(sumr<suml)
sumr+=arr[--r];
else if(suml<sumr)
suml+=arr[++l];
}
printf("%lld",m);
}
|
#include <stdio.h>
#define N 200000
long long d[N + 1];
int main () {
int n, i, j;
long long s, s1, s2;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lld", &d[i]);
}
s = s1 = s2 = 0;
i = 0, j = n - 1;
while (i <= j) {
if (s1 + d[i] <= s2) {
s1 += d[i];
++i;
}
else {
s2 += d[j];
--j;
}
if (s1 == s2) {
s = s1;
}
}
printf("%lld\n", s);
}
|
#include <stdio.h>
#include <stdlib.h>
#define ll long long
ll A[200200],B[200200],n,i,*ptr;
int cmp(void *a, void *b){return *(ll*)a==*(ll*)b?0:*(ll*)a>*(ll*)b?1:-1;}
int main(){
for(scanf("%I64d",&n),i=1;i<=n;i++) scanf("%I64d",&A[i]);
for(i=1;i<=n;i++) B[i]=A[n-i+1]+B[i-1];
for(i=1;i<=n;i++) A[i]+=A[i-1];
for(i=n;i>=0;i--)
if(ptr=bsearch(&A[i],B,n-i+1,sizeof(ll), cmp)) {printf("%I64d\n", *ptr);break;}
}
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int a,d,e;
long long int f;
long long int* b=calloc(200050,8);
long long int* c=calloc(200050,8);
scanf("%d",&a);
for(int i=1;i<=a;i++) scanf("%d",&b[i]);
for(int i=a;i>=1;i--) c[i]=c[i+1]+b[i];
for(int i=2;i<=a;i++) b[i]+=b[i-1];
for(d=1,e=a,f=0;d<e;d++) {
while(b[d]>c[e] && d<e) e--;
if(b[d]==c[e] && d!=e) f=b[d];
}
printf("%lld\n",f);
}
|
#include <stdio.h>
#define N 2*100000+5
int main(int argc, char *argv[])
{
int n,a[N],i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
int p=0,q=n-1;
i=p-1;j=q+1;
long long suma=0,sumb=0;
while(i<j){
if(suma<=sumb){
if(suma==sumb){
p=i;
q=j;
}
i++;
suma+=a[i];
}
else{
j--;
sumb+=a[j];
}
}
suma=0;
for(i=0;i<=p;i++)
suma+=a[i];
printf("%lld\n",suma);
return 0;
}
|
#include<stdio.h>
long long int a[200005]={0};
int main()
{
long long int n,i=0,j,ans=0,sum1=0,sum2=0;
scanf("%lld",&n);
j=n+1;
for(int k=1;k<=n;k++)
scanf("%lld",&a[k]);
a[n+1]=0;
while(i<j)
{
//printf("%lld %lld\n",i,j);
if(sum1==sum2)
{
ans=sum1;
sum1+=a[++i];
sum2+=a[--j];
}
else if(sum1>sum2)
{
sum2+=a[--j];
}
else
{
sum1+=a[++i];
}
//printf("%lld %lld\n",sum1,sum2);
}
printf("%lld\n",ans);
return 0;
}
|
#include <stdio.h>
int d[200001];
__int64 ans,nt=0,a[200001];
int check(__int64 now,int l,int r){
if (l>r) return 0;
int mid;
mid=(l+r)/2;
if (a[mid]==now) return 1;
if (a[mid]<now) return check(now,mid+1,r);
else return check(now,l,mid-1);
}
main(){
int n,i;
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&d[i]);
for (i=1;i<=n;i++) a[i]=a[i-1]+d[i];
ans=0;
for (i=n;i>=1;i--) {
nt+=d[i];
if (nt>a[n]/2) break;
if (check(nt,1,i-1)) ans=nt;
}
printf("%I64d\n",ans);
}
|
#include<stdio.h>
int main()
{
long int n,start,last,i;
scanf("%ld",&n);
long long int arr[n],sum=0,total=0,prev=0;
for(i=0;i<n;i++)
scanf("%lld",arr+i);
start=0;
last=n-1;
while(start<=last)
{
if(sum>=total)
{
total+=arr[last--];
}
else if(total>sum)
{
sum+=arr[start++];
}
if(sum==total)
{
prev=sum;
}
}
printf("%lld",prev);
return 0;
}
|
#include <stdio.h>
int main() {
long long arr[200001], s[200001];
long long n, d1 = 0, d2 = 0, d3 = 0;
long long l, r, split1, split2, i, sum = 0;
scanf("%lld", &n);
for(long long i = 0; i < n; i++) {
scanf("%lld", &arr[i]);
}
s[0] = arr[0];
for(long long i = 1; i < n; i++) {
s[i] = s[i-1] + arr[i];
}
l = 0;
r = n - 1;
while (l < r){
long long s_left = s[l];
long long s_right = s[n-1] - s[r - 1];
if (s_left < s_right) {
l++;
}
else if( s_left > s_right) {
r--;
}
else {
sum = s_left;
l++;
r--;
}
}
printf("%lld", sum);
return 0;
}
|
#include<stdio.h>
long long max(long long a,long long b);
int main(void)
{
int d[200005];
int n;;
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++){
scanf("%d",&d[i]);
}
long long left=0,right=0,maxu=0;
i=0;
j=n-1;
while(i<=j){
if(left<right)
left+=d[i++];
else
right+=d[j--];
if(left==right){
maxu=max(left,right);
}
}
printf("%lld\n",maxu);
return 0;
}
long long max(long long a,long long b)
{
return (a>b)?a:b;
}
|
#include<stdio.h>
int main(){
long long int n,k,i=0,s1=0,s2=0,ans=0;
scanf("%lld",&n);
int j=n+1;
long long int arr[n+2];
for(k=1;k<=n;k++)
{
scanf("%lld",&arr[k]);
}
arr[n+1]=0;
arr[0]=0;
while(j>i)
{
if(s1==s2)
{
ans=s1;
s1+=arr[++i];
s2+=arr[--j];
}
else if(s1>s2)
{
s2+=arr[--j];
}
else
{
s1+=arr[++i];
}
}
printf("%lld\n",ans);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
typedef long long ll;
int main()
{
ll n,arr[200001],i,start,end,sum1,sum2,sumf=0;
scanf("%lld",&n);
for(i=0;i<n;i++)
{
scanf("%lld",&arr[i]);
}
start=0;end=n-1;
sum1=0;sum2=0;
while(start<=end)
{
if(sum1<sum2)
{
sum1+=arr[start];
start++;
}
else if(sum2<sum1)
{
sum2+=arr[end];
end--;
}
else{
sumf=sum1;
sum1+=arr[start];
start++;
}
}
if(sum1==sum2)
{
sumf=sum1;
}
printf("%lld\n",sumf);
return 0;
}
|
#include <stdio.h>
#include <stdint.h>
#include <inttypes.h>
int main()
{
int64_t n, i1=0, i2, count=0, sum1=0, sum2=0, max=0;
scanf("%"PRId64"", &n);
int64_t a[n];
for (long int i=0; i<n; ++i)
scanf("%"PRId64"", &a[i]);
i2 = n-1;
while (count<n)
{
if ((sum1<=sum2)||((sum1==0)&&(sum2==0))) {
sum1 += a[i1];
++i1;
++count;
}else{
sum2 += a[i2];
--i2;
++count;
}
if ((sum1==sum2)&&(sum1>max))
max = sum1;
}
printf("%"PRId64"", max);
}
|
#include<stdio.h>
typedef long long ll;
ll n[200020]={0};
int main(){
ll a;
while(~scanf("%lld",&a)){
ll i,j,sum=0,count=0,flog=0,max1=0;
for(i=1;i<=a;i++){
scanf("%lld",&n[i]);
}
i=1;
j=a;
sum=n[1];
count=n[a];
while(i<j){
if(sum>count){
count+=n[--j];
}
else if(sum<count){
sum+=n[++i];
}
else if(sum==count){
max1=sum;
flog=1;
if(i+1!=j-1){
sum+=n[++i];
count+=n[--j];
}
else{
break;
}
}
}
if(flog==0){
printf("0\n");
}
else{
printf("%lld\n",max1);
max1=0;
}
}
}
|
#include<stdio.h>
#include<stdlib.h>
#define N (2*100000+9)
unsigned arr[N];
typedef unsigned long long llu;
llu g(unsigned* a, unsigned n, unsigned* c, unsigned m, unsigned len,
llu sum1, llu sum2, llu max){
if(m+n>len)return max;
else if(sum1==sum2)return g(a, n+1, c-1,m+1, len, sum1+a[n], sum2+c[-1], sum1);
else if(sum1<sum2)return g(a, n+1, c, m, len, sum1+a[n], sum2, max);
else return g(a, n, c-1, m+1, len, sum1, sum2+c[-1], max);
}
int main(){
unsigned i, n;
scanf("%u", &n);
for(i=0;i<n;i++){
scanf("%u", arr+i);
}
printf("%llu", g(arr,0, arr+n,0, n, 0, 0, 0));
return 0;
}
|
#include<stdio.h>
#include<malloc.h>
int main()
{
int n,l,r,i;
long long *a,lsum=0,rsum=0,maxsum=0;
scanf("%d",&n);
a=(long long*)malloc(sizeof(long long)*n);
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
}
l=0;
r=n-1;
lsum=lsum+a[0];
l++;
while(l<=r)
{
while(lsum<rsum)
{
lsum=lsum+a[l++];
}
while(rsum<lsum)
{
rsum=rsum+a[r--];
}
if(lsum==rsum)
{
maxsum=lsum;
lsum=lsum+a[l++];
}
}
printf("%lld\n",maxsum);
}
|
#include<stdio.h>
int main()
{
int n,t,j;
long long int sum=0,k=0,l;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
}
for(j=0;k<=sum/2;j++)
k=k+a[j];
j=j-1;
k=k-a[j];
if(j!=0){
t=j-1;
l=sum-k;
for(;k!=l;)
{
if(l>k)
{
l=l-a[j];
j++;
}
else
{
k=k-a[t];
t--;
}
}
printf("%lld",k);
}
else
{
if(a[0]==sum/2)
printf("%lld",a[0]);
else
printf("0");
}
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int n;
scanf("%d", &n);
int arr[n];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
long long int front[n+1], back[n+1];
front[0] = back[0] = 0;
for (int i = 1; i <= n; i++) {
front[i] = front[i-1]+arr[i-1];
back[i] = back[i-1]+arr[n-i];
}
int ind_f = 0, ind_b = 0;
long long int max = 0;
while (ind_f + ind_b <= n) {
if (front[ind_f] > back[ind_b]) {
ind_b++;
} else if (front[ind_f] < back[ind_b]) {
ind_f++;
} else if (front[ind_f] == back[ind_b]) {
max = front[ind_f];
ind_f++; ind_b++;
}
}
printf("%lld\n", max);
}
|
#include<stdio.h>
long long n,i,ans,sum,sum1,j,arr[1000000];
int main()
{
scanf("%lld",&n);
for(i=0;i<n;i++)
{
scanf("%lld",&arr[i]);
}
i=0;
j=n-1;
sum=sum1=ans=0;
while(i<=j)
{
if(sum==sum1)
{
ans=sum;
sum=sum+arr[i];
i++;
}
else if(sum>sum1)
{
sum1=sum1+arr[j];
j--;
}
else if(sum<sum1)
{
sum=sum+arr[i];
i++;
}
}
if(sum==sum1)
{
ans=sum;
//sum=sum+arr[i];
// i++;
}
printf("%lld\n",ans);
}
|
#include<stdio.h>
int main()
{
int n,i,j;
long long int a[200010],a1[200010]={0},a2[200100]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
if(i==0)
a1[i]=a[i];
else
a1[i]+=a1[i-1]+a[i];
}
for(i=n-1;i>=0;i--)
{
if(i==n-1)
a2[i]=a[i];
else
a2[i]=a2[i+1]+a[i];
}
/* for(i=0;i<n;i++)
printf("%d ",a1[i]);
printf("\n");
for(i=0;i<n;i++)
printf("%d ",a2[i]);
printf("\n"); */
i=n-1,j=0;
while(i>=0 && j<n)
{
// printf("%d %d\n",a1[i],a2[j]);
if(a2[j]>a1[i])
j++;
if(a2[j]<a1[i])
i--;
if(i<j && a1[i]==a2[j])
break;
if(i>=j && a1[i]==a2[j])
i--,j++;
}
if(i<0 || j>=n)
printf("0\n");
else
printf("%lld\n",a1[i]);
}
|
#include <stdio.h>
#include <stdlib.h>
int main() {
long long int n;
scanf("%I64d", &n);
long long int *nums = (int *)malloc(sizeof(long long int)*n);
for(int i = 0; i < n; i++)
scanf("%I64d", nums+i);
long long int maxMatch = 0;
long long int leftSum = 0, rightSum = 0;
int *left = nums, *right = nums+(n-1);
while(left != right) {
if(leftSum <= rightSum) {
leftSum += *left;
left++;
} else {
rightSum += *right;
right--;
}
if(leftSum == rightSum && leftSum > maxMatch) {
maxMatch = leftSum;
}
}
printf("%I64d", maxMatch);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(int argc, char const *argv[])
{
int n, i;
scanf("%d", &n);
int *v = malloc(n * sizeof(int));
for (i = 0; i < n; i++)
{
scanf("%d", v+i);
}
long long sum = 0, sum_r = 0, sum_l = 0;
int index_l = 0, index_r = n-1;
if(n==0 || n==1)
{
printf("%lld\n", sum);
}
else
{
sum_l = v[0];
sum_r = v[n-1];
while(index_l < index_r)
{
if(sum_l == sum_r)
{
sum = sum_l;
index_l++;
index_r--;
sum_l += v[index_l];
sum_r += v[index_r];
}
else if(sum_l < sum_r)
{
index_l++;
sum_l += v[index_l];
}
else
{
index_r--;
sum_r += v[index_r];
}
}
printf("%lld\n", sum);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<math.h>
#define lli long long int
int main()
{
lli n;
scanf("%lld",&n);
lli d[n+1],sum1[n+1],sum2[n+1];
sum1[0]=0,sum2[0]=0,d[0]=0;
for(lli i=1;i<=n;i++)
{
scanf("%lld",&d[i]);
sum1[i]=d[i]+sum1[i-1];
}
sum2[n]=d[n];
for(lli j=n-1;j>0;j--)
{
sum2[j]=sum2[j+1]+d[j];
}
lli i=1,j=n;
lli ans=0,max=0;
while(j>i)
{
if(sum1[i]<sum2[j])
i++;
else if(sum1[i]>sum2[j])
j--;
else
{
max=sum1[i];
if(max>ans)
ans=max;
i++,j--;
}
}
printf("%lld\n",ans );
}
|
#include <stdio.h>
#include <stdlib.h>
long long arr[200005];
int main(void)
{
long long n, max = 0, i, lptr=1, rptr, suml, sumr;
scanf("%lld", &n);
for(i=1; i<=n; i++)
scanf("%lld", &arr[i]);
rptr = n;
suml = arr[lptr];
sumr = arr[rptr];
while(lptr < rptr)
{
if(suml == sumr)
{
if(suml > max)
max = suml;
lptr++;
rptr--;
suml += arr[lptr];
sumr += arr[rptr];
}
else if(suml < sumr)
{
lptr++;
suml += arr[lptr];
}
else
{
rptr--;
sumr += arr[rptr];
}
}
printf("%lld\n", max);
}
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n;//number of elements in array
//printf("n:");
scanf("%d",&n);
long long arr[n];
long long max=0;
int front=0;
int back=n-1;
for(int i=0;i<n;i++)
{
//printf("arr[%d]:",i);
scanf("%lld",&arr[i]);
}
long long frontSum=arr[0],backSum=arr[n-1];
while(front<back)
{
if(frontSum<backSum)
{
front++;
frontSum += arr[front];
}
if(frontSum>backSum)
{
back--;
backSum += arr[back];
}
if(frontSum==backSum)
{
max = frontSum;
front++;
back--;
frontSum += arr[front];
backSum += arr[back];
}
}
printf("%lld",max);
return 0;
}
|
#include<stdio.h>
#include<string.h>
long long m[200200];
int main()
{
long long n;
long long i;
scanf("%lld",&n);
for(i=0; i<n; i++)
scanf("%lld",&m[i]);
long long p,q,a,b;
p=0;
q=n-1;
a=m[0];
b=m[n-1];
long long sum=0;
while(p<q)
{
if(a==b)
{
sum=a;
if(p+1<q-1)
{
p++;
q--;
a=a+m[p];
b=b+m[q];
}
else
break;
}
else if(a>b)
{
if(p<q-1)
{
q--;
b=b+m[q];
}
else break;
}
else if(a<b)
{
if(p+1<q)
{
p++;
a=a+m[p];
}
else break;
}
}
printf("%lld\n",sum);
return 0;
}
|
#include<stdio.h>
typedef long long ll;
int main()
{
int n,f=0;
scanf("%d",&n);
ll ar[n],sum=0,a=0;
for(int i=0;i<n;i++)
{
scanf("%lld",&ar[i]);
sum+=ar[i];
}
ll ssum=sum;
for(int i=0;i<n;i++)
{
a+=ar[i];
ssum-=ar[i];
if(ssum-a<0)
break;
else if(ssum-a==0)
{
f=1;
break;
}
}
if(f==1)
printf("%lld",a);
else
{
ll pre[n],suf[n];
pre[0]=0;
for(int i=0;i<n-1;i++)
pre[i+1]=pre[i]+ar[i];
/*for(int i=0;i<n;i++)
printf("%lld ",pre[i]);*/
for(int i=0;i<n-1;i++)
suf[i]=sum-pre[i+1];
suf[n-1]=0;
/*for(int i=0;i<n;i++)
printf("%lld %lld\n",pre[i],suf[i]);
*/
int l=0,r=n-1;
ll ans=0;
while(r>=l)
{
if(pre[l]>suf[r])
r--;
else if(pre[l]<suf[r])
l++;
else
{
ans=pre[l];
l++;
r--;
}
}
printf("%lld",ans);
}
/*if(f==1)
printf("%lld",a);
else
{
ll ans=0;
for(int i=0;i<l;i++)
ans+=ar[i];
printf("%lld",ans);
}*/
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<stdbool.h>
#define lli long long int
int main()
{
lli n,i,j;
scanf("%lld",&n);
lli a[n];
for(i=0;i<n;i++)
scanf("%lld",a+i);
lli strtsum=a[0],endsum=a[n-1],strt=0,end=n-1,max=0;
while(strt<end && end>strt)
{
if(strtsum<endsum)
{
strt+=1;
strtsum+=a[strt];
}
else if(strtsum>endsum)
{
end-=1;
endsum+=a[end];
}
else
{
if(strtsum>max)
max=strtsum;
strt+=1;
end-=1;
strtsum+=a[strt];
endsum+=a[end];
}
}
printf("%lld",max);
return 0;
}
|
#include<stdio.h>
#define N 200002
//线性查找超时了
int find(long long target,long long *a,int n){
//数组从1到n-1
/*
printf("find %lld at",target);
int i;
for(i=1;i<n;i++){
printf(" %lld",a[i]);
}
printf("\n");
*/
int l=1;
int r=n-1;
//需要测试l==r的情况
while(l<=r){
int m=(l+r)/2;
//printf("%d %d %d\n",l,m,r);
//printf("%lld %lld %lld\n",a[l],a[m],a[r]);
//l m m1 r
//m1表示实际值，m是一个去掉了小数位的中间整数
if(a[m]==target){
//printf("*%d %lld\n",m,target);
return 1;
}else if(a[m]>target){
//l target m m1 r
r=m-1;
}else{
//l m target m1 r
l=m+1;
}
}
return 0;
}
int main(){
int n;
scanf("%d",&n);
int i;
int d[N];
long long sum[N];
sum[0]=0;
for(i=0;i<n;i++){
scanf("%d",&d[i]);
sum[i+1]=sum[i]+d[i];
}
/*
for(i=0;i<n;i++){
printf("%4d",d[i]);
}
printf("\n");
for(i=1;i<=n;i++){
printf("%4lld",sum[i]);
}
printf("\n");
for(i=0;i<n;i++){
printf("%4lld",sum[n]-sum[i]);
}
printf("\n");
for(i=0;i<n;i++){
printf("%4lld-%4lld",sum[n],sum[i]);
}
printf("\n");
*/
long long left=0;
long long right=0;
long long answer=0;
for(i=n-1;i>=0;i--){
right=sum[n]-sum[i];
left=sum[i];
//printf("left %lld right %lld\n",left,right);
if(left<right){
break;
}
//printf("right sum = %lld\n",right);
if(find(right,sum,i+1)){
//printf("find %lld\n",right);
if(answer<right){
answer=right;
}
}
}
printf("%lld\n",answer);
return 0;
}
|
#include <stdio.h>
int n,ans,i,j;
char A[100100],B[100100];
int main(){
scanf("%i%s%s",&n,A,B);
for(i=0;i<n/2;i++){
if(B[i]==B[n-i-1]){
if(A[i]!=A[n-i-1]) ans++;
continue;
}
char a[]={A[i],A[n-i-1]};
char b[]={B[i],B[n-i-1]};
ans+=2;
for(j=0;j<2;j++)
if(a[j]==b[0]) ans--, b[0]='.';
else if(a[j]==b[1]) ans--, b[1]='.';
}
if(n&1) ans+=A[i]!=B[i];
printf("%i\n", ans);
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
int main(void){
char a[100005],b[100005];
long n;
long i,z=0;
char al,ar,bl,br;
scanf("%ld",&n);
scanf("%s",a);
scanf("%s",b);
for(i=0;i<n/2;i++){
al=a[i];
ar=a[n-i-1];
bl=b[i];
br=b[n-i-1];
if(bl==br){
if(al==ar)
z=z;
else
z++;
}
else{
if((al==br&&bl==ar)||(al==bl&&ar==br))
z=z;
else if((al==bl)||(al==br)||(ar==bl)||(ar==br))
z++;
else
z+=2;
}
}
if(n%2==1)
if(a[n/2]!=b[n/2])
z++;
printf("%ld",z);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char x[1000000], y[1000000], s[10];
int main()
{
long long n, i, w;
scanf("%I64d%s%s", &n, x, y);
w=0;
for(i=0; i<n/2; i++)
{
s[0]=x[i];
s[2]=y[i];
s[1]=x[n-i-1];
s[3]=y[n-i-1];
if(s[2]==s[3]){if(s[0]!=s[1])w++;}
else
{
if(s[0]!=s[2] && s[0]!=s[3])w++;
if(s[1]!=s[2] && s[1]!=s[3])w++;
if((s[1]==s[2] || s[1]==s[3]) && s[0]==s[1])w++;
}
}
if(n%2==1 && x[n/2]!=y[n/2])w++;
printf("%I64d", w);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define N 100005
char a[N], b[N];
int func(char al, char ar, char bl, char br) {
int ret = 0;
if (bl != br) {
if (al == ar) {
ret++;
if (al != bl && al != br) ret++;
}
else {
ret += 2;
if (al == bl || al == br) ret--;
if (ar == bl || ar == br) ret--;
}
}
else {
if (al != ar) ret++;
}
return ret;
}
int main() {
int i, n, m, ans;
scanf("%d", &n);
getchar();
gets(a);
gets(b);
ans = 0;
m = n >> 1;
if (n % 2 == 1 && a[m] != b[m])
ans++;
for (i = 0; i < m; i++)
ans += func(a[i], a[n-1-i], b[i], b[n-1-i]);
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
int n,i,ans=0;
char a[100010],b[100010];
scanf("%d %s %s",&n,a,b);
for( i=0;i<n/2;i++)
{
if(a[i]!=b[i]&&a[n-1-i]!=b[n-1-i])
{
if(a[i]==a[n-1-i]&&b[i]==b[n-1-i])
continue;
else if(a[i]==b[n-1-i]&&b[i]==a[n-1-i])
continue;
else if(a[i]==b[n-1-i]&&b[i]!=a[n-1-i]||a[i]!=b[n-1-i]&&b[i]==a[n-1-i])
++ans;
else if(a[i]!=a[n-1-i]&&b[i]==b[n-1-i])
++ans;
else
{
ans+=2;
}
}
else if(a[i]!=b[i]&&a[n-1-i]==b[n-1-i]||a[n-1-i]!=b[n-1-i]&&a[i]==b[i])
{
++ans;
}
}
if(n&1)
{
if(a[n/2]!=b[n/2])
++ans;
}
printf("%d\n",ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
scanf("%d",&n);
char string1[100001];
char string2[100001];
scanf("%s%s",&string1,&string2);
int preprocess = 0;
if(n%2)
{
if(string1[(n/2)]!=string2[(n/2)])
preprocess++;
}
for(int i=0;i<(n/2);i++)
{
char char1 = string1[i];
char char2 = string1[n-i-1];
char char3 = string2[i];
char char4 = string2[n-i-1];
int flag1 =0;
int flag2 =0;
int flag3 =0;
int flag4 =0;
if(char1 == char2)
{
flag1=1;
flag2=1;
}
if(char1 == char3)
{
flag1=1;
flag3=1;
}
if(char1 == char4)
{
flag1=1;
flag4=1;
}
if(char2 == char3)
{
flag2=1;
flag3=1;
}
if(char2 == char4)
{
flag2=1;
flag4=1;
}
if(char3 == char4)
{
flag3=1;
flag4=1;
}
int sum = flag1+flag2+flag3+flag4;
switch(sum)
{
case 0:
preprocess++;
preprocess++;
break;
case 2:
preprocess++;
if(!flag3 && !flag4)
preprocess++;
break;
case 3:
preprocess++;
}
}
printf("%d\n",preprocess);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int fa[200001],ans[200001],first[200001],next[200001],v[200001];
int begin[200001],end[200001],cnt=0,q[200001];
void DFS(int step){
int i;
i=first[step];
begin[step]=++cnt;
q[cnt]=step;
while(i){
DFS(v[i]);
i=next[i];
}
end[step]=cnt;
return;
}
int main(){
int i,j,n,m,p,t;
scanf("%d%d",&n,&m);
for(i=2;i<=n;i++)
scanf("%d",&fa[i]);
for(i=n;i>=2;i--){
v[i]=i;
next[i]=first[fa[i]];
first[fa[i]]=i;
}
DFS(1);
for(i=1;i<=m;i++){
scanf("%d%d",&p,&t);
if(t>end[p]-begin[p]+1){
ans[i]=-1;
}
else{
ans[i]=q[begin[p]+t-1];
}
}
for(i=1;i<=m;i++)
printf("%d\n",ans[i]);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define N 200000
int oo[1 + (N - 1) * 2], oj[1 + (N - 1) * 2];
int link (int i, int j) {
static int _ = 1;
oo[_] = i, oj[_] = j;
return _++;
}
int ae[N], aa[N], vl[N], conto[N], pos[N];
int c;
char vis[N];
void dfs (int i) {
int o, j;
if (vis[i] == 0) {
return;
}
vis[i] = 0;
vl[c++] = i;
for (o = ae[i]; o; o = oo[o]) {
j = oj[o];
dfs (j);
}
}
int set (int i) {
int o, j, s;
s = conto[i];
for (o = ae[i]; o; o = oo[o]) {
j = oj[o];
s += conto[j];
}
conto[i] = s;
return s;
}
int main () {
int n, q, k, i, j, u, v, p, x;
scanf("%d%d", &n, &q);
for (i = 2; i <= n; i++) {
scanf("%d", &aa[i]);
conto[aa[i] - 1]++;
}
for (i = n; i >= 2; i--) {
ae[aa[i] - 1] = link (ae[aa[i] - 1], i - 1);
}
memset (vis, 1, sizeof vis);
c = 0;
dfs (0);
for (i = 0; i < n; i++) {
pos[vl[i]] = i;
}
for (i = n - 1; i >= 0; i--) {
conto[vl[i]] = set (vl[i]);
}
while (q--) {
scanf("%d%d", &u, &k);
--u;
if (k - 1 > conto[u]) {
printf("-1\n");
}
else {
p = pos[u] + k - 1;
printf("%d\n", vl[p] + 1);
}
}
}
|
#include<stdio.h>
#include<stdlib.h>
#define N (2*100000+9)
unsigned father[N];
unsigned minChild[N];
unsigned nextBrother[N];
unsigned size[N];
unsigned stack[N];
unsigned sit[N];
unsigned rank[N];
unsigned countOff(unsigned i){
if(i==0)return 0;
else{
size[i] = 1+countOff(minChild[i]);
return size[i] + countOff(nextBrother[i]);
}
}
void spread(unsigned i, unsigned index){
if(i==0)return;
else{
sit[i]=index;
rank[index]=i;
spread(minChild[i], index+1);
spread(nextBrother[i], index+size[i]);
}
}
int main(){
unsigned i, n, u, k, q, f;
scanf("%u%u", &n, &q);
for(i=2;i<n+1;i++){
scanf("%u", &f);
father[i]=f;
}
for(i=n+1;i>1;i--){
nextBrother[i]=minChild[father[i]];
minChild[father[i]]=i;
}
countOff(1);
/*
for(i=1;i<n+1;i++)
printf("(%u, %u), ", i, size[i]);
printf("\n");
*/
spread(1, 1);
/*
for(i=1;i<n+1;i++)
printf("(%u, %u), ", i, sit[i]);
printf("\n");
*/
for(i=0;i<q;i++){
scanf("%u%u", &u, &k);
if(k-1<size[u]){
printf("%u\n",rank[sit[u]+k-1]);
}
else
printf("-1\n");
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define N 200000
int ds[N + 1], pos[N + 1], count[N + 1];
char vis[N + 1];
int c;
struct info{
int *a;
int c;
} g[N + 1];
void rlc (int i, int c) {
g[i].a = (int *) realloc (g[i].a, c * sizeof *g[i].a);
}
void push (int u, int v) {
int c;
c = g[u].c += 1;
rlc(u, c);
g[u].a[c - 1] = v;
}
void dfs1 (int node) {
int i;
if (vis[node] == 0) {
return;
}
vis[node] = 0;
ds[c++] = node;
for (i = 0; i < g[node].c; i++) {
dfs1 (g[node].a[i]);
}
}
int dfs2 (int node) {
int i, s;
s = g[node].c;
for (i = 0; i < g[node].c; i++) {
s += g[g[node].a[i]].c;
}
g[node].c = s;
return s;
}
int main () {
int n, q, u, v, k, p, i, j;
scanf("%d%d", &n, &q);
for (i = 2; i <= n; i++) {
scanf("%d", &v);
push (v, i);
//push (v, i);
}
memset (vis, 1, sizeof vis);
c = 0;
dfs1 (1);
for (i = n - 1; i >= 0; i--) {
count[ds[i]] = dfs2 (ds[i]);
}
for (i = 0; i < c; i++) {
pos[ds[i]] = i;
}
while (q--) {
scanf("%d%d", &u, &k);
if (k - 1 > count[u]) {
printf("-1\n");
}
else{
p = pos[u] + k - 1;
printf("%d\n", ds[p]);
}
}
}
|
#include<stdio.h>
#include<stdlib.h>
int p = 0;
int f[200001][2];
int d[200001];
struct node {
int u;
struct node* next;
};
struct list{
struct node* head;
struct node* tail;
}a[200001];
struct node* insert(struct node* tail,int i){
struct node* temp = (struct node*)malloc(sizeof(struct node));
temp->u = i;
temp->next = 0;
if(tail==0){
return temp;
}
tail->next = temp;
return temp;
}
void fun(int i){
d[++p] = i;
f[i][0] = p;
struct node* temp = a[i].head;
while(temp){
fun(temp->u);
temp = temp->next;
}
f[i][1] = p;
return ;
}
int main(){
int n,q,i,u;
scanf("%d%d",&n,&q);
for(i=2;i<=n;i++){
scanf("%d",&u);
if(a[u].head==0){
a[u].head = a[u].tail = insert(a[u].head,i);
}else
a[u].tail = insert(a[u].tail,i);
}
// int d[n+1];
fun(1);
// for(i=1;i<=p;i++)
// printf("%d ",d[i]);
// printf("\n");
// for(i=1;i<=n;i++)
// printf("%d %d\n",f[i][0],f[i][1]);
int v;
while(q--){
scanf("%d%d",&u,&v);
if(f[u][1]-f[u][0]+1<v)
printf("-1\n");
else{
printf("%d\n",d[f[u][0]+v-1]);
}
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int DFS(int Index,int **input,int *inputend,int *result,int *resultend,int *count)
{
if(inputend[Index]==0)
return 1;
int i;
int cnt = 1;
for(i = 0; i < inputend[Index]; i ++)
{
result[*resultend] = input[Index][i];
*resultend += 1;
cnt += DFS(input[Index][i],input,inputend,result,resultend,count);
}
return count[Index] += cnt;
}
int main()
{
int N,Qnum;
while(~scanf("%d %d",&N,&Qnum))
{
int *input[N+3];
int inputend[N+3];
memset(inputend,0,sizeof(inputend));
int i;
int index;
for(i = 1;i < N;i ++)
{
input[i] = malloc(sizeof(int));
}
for(i = 1; i < N; i ++)
{
scanf("%d",&index);
input[index] = realloc(input[index],(inputend[index]+2)*sizeof(int));
input[index][inputend[index]++] = i+1;
}
int result[N+3];
memset(result,0,sizeof(int));
int resultend = 0;
result[resultend++] = 1;
int count[N+3];
memset(count,0,sizeof(count));
DFS(1,input,inputend,result,&resultend,count);
for(i = 0;i < N+3;i ++)
{
if(count[i]==0)
count[i] = 1;
}
int output[N+2];
for(i = 0;i < resultend;i ++)
{
output[result[i]] = i;
}
int tmp1,tmp2;
while(Qnum--)
{
scanf("%d %d",&tmp1,&tmp2);
if(count[tmp1] < tmp2)
printf("-1\n");
else
{
printf("%d\n",result[output[tmp1]+tmp2-1]);
}
}
}
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
struct graph{
long int node;
struct graph *next;
};
struct graph *vertex[200001];
long int pos=1,arr[200001],post[200001],store,count[200001];
void add_edge(int a,int b)
{
if(vertex[a]!=NULL)
{
struct graph *fake=vertex[a];
struct graph *temp=malloc(sizeof(struct graph));
temp->node=b;
temp->next=NULL;
while(fake->next)
fake=fake->next;
fake->next=temp;
}
else
{
struct graph *temp=malloc(sizeof(struct graph));
temp->node=b;
temp->next=NULL;
vertex[a]=temp;
}
}
long int dfs(long int u)
{
arr[pos++]=u;
post[u]=pos-1;
long int q=0;
long int l=0;
struct graph *temp=malloc(sizeof(struct graph));
temp=vertex[u];
while(temp!=NULL)
{
q+=dfs(temp->node)+1;
l++;
temp=temp->next;
}
if(l==0){
count[u]=q+1;
return 0;
}
else
{
count[u]=q+1;
return q;
}
}
int main()
{
long int n,q,i;
scanf("%ld %ld",&n,&q);
long int temp;
for(i=2;i<=n;i++){
scanf("%ld",&temp);
add_edge(temp,i);
}
count[1]=dfs(1)+1;
for(i=0;i<q;i++)
{
long int u,k;
scanf("%ld %ld",&u,&k);
store=post[u];
if(count[u]>=k)
{
printf("%ld\n",arr[store+k-1]);
}
else
printf("-1\n");
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int compare (const void * t1, const void * t2)
{
int f = *((int*)t1);
int s = *((int*)t2);
if (f > s) return 1;
if (f < s) return -1;
return 0;
}
int main(){
int size;
scanf("%d",&size);
int arr[size];
for (int i = 0; i < size; ++i){
int x;
scanf("%d",&x);
arr[i] = x;
}
int max=1;
int currentCount=1;
qsort(arr,size,sizeof(int),compare);
if (size>1){
for (int i = 1; i < size; ++i){
if (arr[i]==arr[i-1]){
currentCount++;
if (currentCount>max)
max = currentCount;
}
else{
currentCount=1;
}
}
}
printf("%d\n",size-max);
return 0;
}
|
# include <stdio.h>
long long int arr[100000];
void merge(int l,int m, int r){
int i,j,k;
int n1=m-l+1;
int n2=r-m;
long long int L[n1];long long int R[n2];
for (i=0;i<n1;i++) L[i]=arr[l+i];
for (j=0;j<n2;j++) R[j]=arr[m+1+j];
i=0;j=0;k=l;
while (i<n1 && j<n2){
if (L[i]<=R[j]){
arr[k]=L[i];
i++;
}
else {
arr[k]=R[j];
j++;
}
k++;
}
while (i<n1){
arr[k]=L[i];
k++;i++;
}
while (j<n2){
arr[k]=R[j];
k++;j++;
}
}
void mergesort(int l,int r){
if (l<r){
int mid=(l+r)/2;
mergesort(l,mid);
mergesort(mid+1,r);
merge(l,mid,r);
}
}
int main(void){
int n,max=1;
scanf("%d",&n);
for (int i=0;i<n;i++) scanf("%lld",&arr[i]);
mergesort(0,n-1);
int sim=1;
for(int i=1;i<n;i++){
if(arr[i]==arr[i-1]){
sim++;
}
else{
sim=1;
}
if(sim>max){
max=sim;
}
}
printf("%d\n",n-max);
return 0;
}
|
#include <stdio.h>
void merge(int arr[], int lo, int hi){
int mid=(hi+lo)/2;
int temp[hi-lo+1];
int p1=lo, p2=mid+1, k=0;
while(p1<=mid&&p2<=hi){
if(arr[p1]<=arr[p2]){
temp[k]=arr[p1];
k++;
p1++;
}
else{
temp[k]=arr[p2];
k++;
p2++;
}
}
while(p1<=mid){
temp[k]=arr[p1];
k++;
p1++;
}
while(p2<=hi){
temp[k]=arr[p2];
k++;
p2++;
}
for(int i=0;i<k;i++){
arr[i+lo]=temp[i];
}
}
void mergeSort(int arr[], int lo, int hi){
if(lo==hi) return;
int mid=(hi+lo)/2;
mergeSort(arr, lo, mid);
mergeSort(arr, mid+1, hi);
merge(arr, lo, hi);
}
int main() {
int n;
scanf("%d", &n);
int arr[n];
for (int i=0;i<n;i++) scanf("%d", &arr[i]);
mergeSort(arr, 0, n-1);
int tail=0, c=0;
for (int i=0;i<n;i++) {
if (arr[i]>arr[tail]) {
c++;
tail++;
}
}
printf("%d\n", c);
}
|
#include <stdio.h>
typedef int DataType_t;
void BinaryHeapPush(DataType_t *array, int *len, DataType_t val)
{
++(*len);
int now = *len;
while(now > 1 && val > array[now >> 1]) {
array[now] = array[now >> 1];
now >>= 1;
}
array[now] = val;
}
DataType_t BinaryHeapPop(DataType_t *array, int *len)
{
DataType_t ret = array[1];
int now = 1, temp;
while((now << 1) <= *len) {
temp = now << 1;
if((temp + 1) <= *len && array[temp + 1] > array[temp]) {
++temp;
}
if(array[temp] > array[*len]) {
array[now] = array[temp];
} else {
break;
}
now = temp;
}
array[now] = array[*len];
--(*len);
return ret;
}
void BinaryHeapSort(DataType_t *array, int len)
{
while(len) {
int curIdx = len;
array[curIdx] = BinaryHeapPop(array, &len);
}
}
int A[100001];
char Flag[100001];
int main()
{
int n, num, size = 0, i, j, ans;
scanf("%d", &n);
for(i = 0; i < n; ++i) {
scanf("%d", &num);
BinaryHeapPush(A, &size, num);
}
BinaryHeapSort(A, n);
i = 1, j = 1, ans = 0;
while(i <= n) {
while(++j <= n) {
if(A[j] != A[i]) {
++i;
++ans;
break;
}
}
if(j >= n) {
break;
}
}
printf("%d\n", ans);
return 0;
}
|
/* https://codeforces.com/blog/entry/60572 (first solution) */
#include <stdio.h>
#include <stdlib.h>
int query(long long x, long long y) {
int q;
printf("%lld %lld\n", x, y), fflush(stdout);
scanf("%d", &q);
if (q == 0)
exit(0);
return q;
}
int main() {
long long n, xl, xm, xr, yl, ym, yr;
scanf("%lld", &n);
xl = 1, xm = n + 1, xr = n + 1, yl = 1, ym = n + 1, yr = n + 1;
while (xm - xl > 1 || xr - xm > 0 || ym - yl > 1 || yr - ym > 0) {
long double alu = (long double) (xm - xl) * (ym - yl);
long double aru = (long double) (xr - xm) * (ym - yl);
long double ald = (long double) (xm - xl) * (yr - ym);
if (aru > alu + ald) {
int q = query(xm, (yl + ym) / 2);
if (q == 1)
xl = xm + 1, xm = xr, yr = ym;
else if (q == 2)
yl = (yl + ym) / 2 + 1;
else
ym = (yl + ym) / 2;
} else if (ald > alu + aru) {
int q = query((xl + xm) / 2, ym);
if (q == 2)
yl = ym + 1, ym = yr, xr = xm;
else if (q == 1)
xl = (xl + xm) / 2 + 1;
else
xm = (xl + xm) / 2;
} else {
int q = query((xl + xm) / 2, (yl + ym) / 2);
if (q == 1)
xl = (xl + xm) / 2 + 1;
else if (q == 2)
yl = (yl + ym) / 2 + 1;
else
xm = (xl + xm) / 2, ym = (yl + ym) / 2;
}
}
query(xl, yl);
return 0;
}
|
char *v="aouie",f,p;main(i){for(;~(i=getchar());p=i)f|=!strchr(v,i)&!strchr(v,p)&p!=110;puts(f?"NO":"YES");}
|
#include<stdio.h>
#include<string.h>
int judge(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u') return 1;
return 0;
}
int main()
{
char s[120];
gets(s);
int ans=0;
int len=strlen(s);
for(int i=0;i<len;i++)
{
if(!judge(s[i])&&s[i]!='n')
{
if(i+1>=len||!judge(s[i+1]))
{
printf("NO");
return 0;
}
}
}
printf("YES");
// a 97,e 101,i 105,n 110,o 111,u 117
return 0;
}
|
#include<stdio.h>
int main()
{
char c;
int i=100,flag=0;
while(i>0)
{
scanf("%c",&c);
if(c>='a'&&c<='z')
{
if(c!='a'&&c!='e'&&c!='i'&&c!='o'&&c!='u'&&c!='n')
{
scanf("%c",&c);
i--;
if(c!='a'&&c!='e'&&c!='i'&&c!='o'&&c!='u')
{
flag=1;
break;
}
else
{
i=i-1;
}
}
}
else
break;
}
if(flag==1)
printf("NO");
else
printf("YES");
}
|
#include<stdio.h>
#include<stdlib.h>
int checkVowel(char ch){
if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u'){
return 1;
}else{
return 0;
}
}
int main(){
char str[1000];
scanf("%s",str);
for(int itr=0;str[itr];itr++){
if((!checkVowel(str[itr]) && checkVowel(str[itr+1])) || str[itr]=='n' || (checkVowel(str[itr]))){
continue;
}else{
printf("NO");
exit(0);
}
}
printf("YES");
return 0;
}
|
#include<stdio.h>
#include<string.h>
_Bool isConsonant(char c)
{
return c != 'a' && c != 'o' && c != 'u' && c != 'i' && c != 'e';
}
int main()
{
char s[100];
long int len;
int i,ans;
scanf("%s",s);
len=strlen(s);
ans=0;
for(i=0;i<len;i++)
{
if (s[i] != 'n' && isConsonant(s[i]) && isConsonant(s[i + 1]))
{
ans=1;
break;
}
}
if(ans==1)
{
printf("NO \n");
}
else
{
printf("YES \n");
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define ll long long
int flag, len,i;
char str[111];
int main()
{
for(scanf("%s",&str), len=strlen(str);i<len;i++)
{
if(str[i]=='n') continue;
if(str[i]!='a' && str[i]!='o' && str[i]!='u' && str[i]!='i' && str[i]!='e')
if(str[i+1]!='a' && str[i+1]!='o' && str[i+1]!='u' && str[i+1]!='i' && str[i+1]!='e')
{flag=1;break;}
}
if(flag) printf("NO\n");
else printf("YES\n");
}
|
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
main()
{
int l, i, j, d = 0;
char b[] = "aeiou", c[101];
scanf("%s", c);
l = strlen(c);
for (i = 0; i < l; i++)
if (c[i] == 'n' || c[i] == 'a' || c[i] == 'e' || c[i] == 'i' || c[i] == 'o' || c[i] == 'u')
{
continue;
}
else
{
d = 0;
for (j = 0; j < 5; j++)
{
if (c[i + 1] == b[j])
d++;
}
if (!d)
{
printf("NO\n");
exit(0);
}
}
printf("YES\n");
}
|
#include<stdio.h>
int isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return 1;
else
return 0;
}
int isend(char c)
{
if(c=='\n'||c=='\t'||c==EOF)
return 1;
else
return 0;
}
int main()
{
char ch,last;
scanf("%c",&last);
scanf("%c",&ch);
while(!isend(ch))
{
if(isvowel(ch)||isvowel(last)||last=='n')
{
last=ch;
scanf("%c",&ch);
}
else
{
printf("NO");
return 0;
}
}
if(isvowel(last)||last=='n')
printf("YES");
else
printf("NO");
return 0;
}
|
#include <stdio.h>
int main() {
char c[100];
int s=0,i,j;
for(j=0;j<100;j++){
scanf("%c",&c[j]);
//printf("%c",c[j]);
if(c[j]=='\n')
break;
}
for(i=0;i<j;i++){
if(c[i]!= 'a' && c[i] != 'e' && c[i] != 'i' && c[i] != 'o' && c[i] != 'u' && c[i]!='n'){
if(c[i+1]!= 'a' && c[i+1] != 'e' && c[i+1] != 'i' && c[i+1] != 'o' && c[i+1] != 'u')
{ s=1;
}
}
}
if(s!=1)
printf("YES");
else
printf("NO");
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int X,P=1,i;
char A[105];
scanf("%s",A);
X=strlen(A);
if(A[X-1]=='n' || A[X-1]=='a' || A[X-1]=='e' || A[X-1]=='i' || A[X-1]=='o' || A[X-1]=='u')
{
P=1;
}
else
{
P=2;
}
for(i=0;A[i+1]!='\0';i++)
{
if((A[i]!='n' && A[i]!='a' && A[i]!='e' && A[i]!='i' && A[i]!='o' && A[i]!='u') && (A[i+1]!='a' && A[i+1]!='e' && A[i+1]!='i' && A[i+1]!='o' && A[i+1]!='u'))
{
P=2;
}
}
if(P==2)
{
printf("NO\n");
}
else
{
printf("YES\n");
}
}
|
#include <stdio.h>
int main()
{
int x=1;
int i;
char ch[100];
gets(ch);
for(i=0;ch[i]!='\0';i++)
{
switch(ch[i])
{
case 'a':;
case 'e':;
case 'i':;
case 'o':;
case 'u':;
case 'n':break;
default:
if(ch[i+1]!='a' && ch[i+1]!='e' && ch[i+1]!='i' && ch[i+1]!='o' && ch[i+1]!='u')
x=0;
}
}
if(x)
printf("YES");
else
printf("NO");
}
|
#include <stdio.h>
#include <string.h>
int main(){
char en[150];
gets(en);
int l=strlen(en);
if(en[l-1]!='a'&&en[l-1]!='e'&&en[l-1]!='i'&&en[l-1]!='o'&&en[l-1]!='u'&&en[l-1]!='n'){
printf("NO\n");
}
else{
int i;
for(i=0;i<l-1;i++){
if(en[i]!='a'&&en[i]!='e'&&en[i]!='i'&&en[i]!='o'&&en[i]!='u'&&en[i]!='n'){
if(en[i+1]!='a'&&en[i+1]!='e'&&en[i+1]!='i'&&en[i+1]!='o'&&en[i+1]!='u'){
break;
}
}
}
if(i==l-1)printf("YES\n");
else printf("NO\n");
}
return 0;
}
|
#include <stdio.h>
int vowel(char ch)
{
if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')
return 1;
else
return 0;
}
int send(char ch)
{
if(ch==' '||ch=='\t'||ch=='\n'||ch==EOF)
return 1;
else
return 0;
}
int main()
{
char ch,last;
scanf("%c",&last);
scanf("%c",&ch);
while(!send(ch))
{
if(!vowel(ch)&&(!vowel(last)&&last!='n'))
{ printf("no\n");
return 0;
}
else
{
last=ch;
scanf("%c",&ch);
}
}
if ( !vowel(last) && last != 'n') {
printf("NO\n");
return 0;
}
printf("YES\n");
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.