게시판

/* #include <stdio.h> int main() { int n[7], sum = 0; for (int i = 0; i < 7; i++) { scanf("%d", &n[i]); } for (int i = 0; i < 7; i++) { if (n[i] % 2 != 0) { sum += n[i]; } } if (sum == 0) { printf("-1"); } else { printf("%d", sum); } return 0; } */ /* #include <stdio.h> int main() { int data[10], max, min; for (int i = 0; i < 10; i++) { scanf("%d", &data[i]); } for (int i = 1; i <= 1; i++) { int sum = 0; while (data[0] != 0) { sum += data[0] % 10; data[0] /= 10; } max = sum; min = sum; } for (int i = 1; i < 10; i++) { int sum = 0; while (data[i] != 0) { sum += data[i] % 10; data[i] /= 10; } if (max < sum) { max = sum; } if (min > sum) { min = sum; } } printf("%d %d", max, min); return 0; } */ /* #include <stdio.h> int main() { int n[7], odd[7], sum = 0, j = 0; for (int i = 0; i < 7; i++) { scanf("%d", &n[i]); if (n[i] % 2 != 0) { sum += n[i]; odd[j] = n[i]; j++; } } int min = odd[0]; for (int i = 0; i < j; i++) { if (min > odd[i]) { min = odd[i]; } } if (sum == 0) { printf("-1"); } else { printf("%d\n%d", sum, min); } return 0; } */ /* #include <stdio.h> #include <limits.h> int main() { int n[9], i, index, max = INT_MIN; for (i = 0; i < 9; i++) { scanf("%d", &n[i]); } for (i = 0; i < 9; i++) { if (max < n[i]) { max = n[i]; index = i; } } printf("%d\n%d", max, index + 1); return 0; } */

/*#include <stdio.h> #include <stdlib.h> int main() { printf("Hello world!\n"); return 0; } */ /* #include <stdio.h> int main() { int n,i; int arr[10001] = {}; arr[0] = arr[1] = 1; scanf("%d", &n); for (i = 2; i < n; i++) { arr[i] = arr[arr[i-1]-1] + arr[i-arr[i-1]]; } printf("%d", arr[n - 1]); return 0; } */ /*#include<stdio.h> void sub(int k) { if(k==0) { return; } printf("%d\n", k); sub(k-1); } int main() { int n; scanf("%d", &n); sub(n); } /* sub(5) { sub(4) { sub(3) { // stack } } } */ /*#include<stdio.h> void function(int i) { if(i==0) { return; } function(i-1); printf("%d\n",i); } int main() { int n; scanf("%d",&n); function(n); }*/ /*#include<stdio.h> void f(int k) { if(k==0) { return; } printf("%d\n",k); f(k-1); } int main() { int n; scanf("%d",&n); f(n); }*/ /*#include<stdio.h> void f(int k,int i) { if(k>i) { return; } if(k%2!=0) { printf("%d ",k); } f(k+1,i); } int main() { int a,b; scanf("%d %d",&a,&b); f(a,b); }*/ /*#include<stdio.h> int f(int k) { if(k==0) { return 0; } return k+f(k-1); } int main() { int n; scanf("%d",&n); printf("%d",f(n)); }*/ /* #include<stdio.h> int f(int k) { if(k==1) { return k; } return k*f(k-1); } int main() { int n; scanf("%d",&n); printf("%d",f(n)); } */ // non-linearity recursion function // memoization /*#include<stdio.h> int rec(int k) { if() { return 0; } return rec(k-1) + rec(k-2); } int main() { sadsa }*/ // 1915 1953 1928 1920 // 1916 3702 3733 /*#include<stdio.h> int f(int k) { if(k==1||k==2) { return 1; } return f(k-1)+f(k-2); } int main() { int N; scanf("%d",&N); printf("%d",f(N)); }*/ /*#include<stdio.h> void star(int k) { if(k==0) { return; } star(k-1); printf("*"); } void f(int k) { if(k==0) { return; } f(k-1); star(k); printf("\n"); } int main() { int n; scanf("%d",&n); f(n); }*/ /*#include<stdio.h> void f(int k) { if(k==1) { return; } if(k%2==1) { k=k*3+1; printf("%d\n",k); } else if(k%2==0) { k=k/2; printf("%d\n",k); } f(k); } int main() { int n; scanf("%d",&n); printf("%d\n",n); f(n); } */

/*#include <bits/stdc++.h> using namespace std; int segment[200001], arr[50001], n, ret, m; int make(int node, int start, int End) { if(start==End)return segment[node]=arr[start]; int mid=(start+End)/2; int l=arr[mid], r=arr[mid+1], le=l, ri=r; for(int i=mid-1;i>=start;i--) { l+=arr[i]; le=max(l, le); } for(int i=mid+2;i<=End;i++) { r+=arr[i]; ri=max(r, ri); } return segment[node]=max(ri+le, max(make(node*2, start, mid), make(node*2+1, mid+1, End))); } int res(int node, int start, int End, int lef, int rig) { if(lef<=start&&End<=rig)return segment[node]; if(End<lef||start>rig)return -2147483647; int mid=(start+End)/2; int l=arr[mid], r=arr[mid+1], le=l, ri=r; for(int i=mid-1;i>=max(start, lef);i--) { l+=arr[i]; le=max(l, le); } for(int i=mid+2;i<=min(rig, End);i++) { r+=arr[i]; ri=max(r, ri); } if(mid>=lef&&mid+1<=rig) { } else { le=-987654321, ri=-987654321; } return max(ri+le, max(res(node*2, start, mid, lef, rig), res(node*2+1, mid+1, End, lef, rig))); } int main() { scanf("%d", &n); for(int i=1;i<=n;i++)scanf("%d", &arr[i]); make(1, 1, n); //printf("%d", segment[2]); scanf("%d", &m); int a, b; for(int i=1;i<=m;i++) { scanf("%d %d", &a, &b); printf("%d\n", res(1, 1, n, a, b)); } }*/ #include <bits/stdc++.h> using namespace std; int main() { }