Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | /****** BISMILLAH HIR RAHMANIR RAHIM ******/
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <e... | 1,261 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
int candies[2][N];
int score_sum = 0;
for(int i = 0; i < 2; i++){
for(int j = 0; j < N; j++){
cin >> candies[i][j];
if(i){
score_sum += candies[i][j];
... | 169 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int a[200][2], d[200][2];
for (int i = 0; i < 2; ++i) {... | 255 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define mkp make_pair
#define fi first
#define se second
#define pt(num) cout << num << "\... | 331 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <iostream>
#include <vector>
using namespace std;
int dp[2][105];
int can[2][105];
int n;
int pick(int x, int y)
{
if (x==1&&y==n-1)
{
return can[x][y];
}
if (dp[x][y]!=-1)return dp[x][y];
if (x!=1)dp[x][y]=pick(x+1,y);
if (y+1<n)dp[x][y]=max(dp[x][y],pick(x,y... | 233 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int INF = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v1{0}, v2{0};
for (int i = 0; i < n; ++i)... | 229 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(int i=0;i<int(n);i++)
#define N 200
int main(){
vector<int>a;
vector<int>b;
int... | 263 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long unsigned int llui;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef set<int> si;
typedef map<string, int> msi;
#define INF INT_MAX
#define MOD 1000000007
#define E... | 706 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(X) scanf("%d", &(X))
#define sll(X) scanf("%lld",&(X))
#define INFL 0x3f3f3f3f3f3f3f3fLL
const ll mod = 1e9 + 7;
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll expo(ll base,ll pow){ll ans = 1;
whi... | 396 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
int a[2][N];
int Sum(int row, int l, int r) {
int res = 0;
for (int i = l; i < r; i++) res += a[row][i];
return res;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &a... | 211 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll mod = 1e9 + 7;
const int INF = 1e9;
int main() {
cin.sync_with_stdio(false);
int N;
cin >> N;
int A[2][100], B[2][... | 243 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <queue>
#define NMAX 102
using namespace std;
int main(){
int N,A[2][NMAX],dp[2][NMAX] = {};
cin >> N;
for (int i = 0; i < 2; ++i)
{
for (int j = 0; j < N; ++j)
{
cin >> A[i][j];
dp[i][j] = A[i][j];
}
}
for (int i = 0; i < 2; ++i)
{
for (int j = 0; j ... | 262 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define F(i,n) for (int i = 0; i < n; ++i)
#define F1(i,n) for (int i = 1; i <= n; ++i)
#define dbg(x) cerr << #x << " = " << x << endl
#define dbgg(x) cerr << #x << " = " << x << ' '
#de... | 487 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rr... | 507 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define foreach(i, v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define BETWEEN(a, x, b) (a<=x&&x<b)
using namespace std;
typedef long long ll;
int a[2][200];
int dp[2][200];
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.ti... | 234 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int>a(n+1,0),b(n+1,0);
rep(i,n){
cin >> a[i];
}
rep(i,n){
... | 183 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <un... | 322 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[2][101] = {};
for ( int i = 0; i < 2; i++ ) {
for ( int j = 0; j < n; j++ ) {
cin >> a[i][j];
long long int k = 0;
if ( j > 0 ) k = max( k, a[i][j-1] );
if ( i > 0 ) k = max( k, a[i... | 165 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
int main(void){
int n;
cin>>n;
vector<int> a(n),b(n);
rep(i,n)cin>>a[i];
rep(i,n)cin>>b[i];
int res = 0;
rep(k,n){
int sum = 0;
rep(x,k+1){
sum += a[x];
}
for... | 144 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int main()
{
int N, A[2][100];
cin >> N;
for(int i = 0; i < 2; i++) {
for(int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int dp[2][100];
fill_n(*dp, 2 * 100, -INF);
dp[0][0] = A[0][0];
for(in... | 250 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int main(){
int n;
cin >> n;
vi a(n + 2 , 0);
for(int i = 1; i <=n; i++){
cin >> a[i];
a[i] += a[i- 1];
}
vi b(n + 2, 0);
for(int i = 1; i <=n; i++){
cin >> b[i];
}
for(int i = n; i >= 1; --i){
b[i] += b[i + 1];
}
for(int i = 1; i <=n; i++... | 216 |
Project_CodeNet | 2,018 | #include<algorithm>
#include<cmath>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<unordered_map>
#include<unordered_set>
#include<vector>
using uint = unsigned int;
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (l... | 347 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mst(a,b) memset((a),(b),sizeof(a))
#define pi acos(-1)
#define pii pair<int,int>
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
const int MAXN = 1e2 + 10;
const int MAXM = 2e6 + 10;
const ll mod = 1e9 + 7;
ll a[3][110],suml[3][110],sumr[... | 376 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<array>
using namespace std;
int main(){
int n,i,c=0;
cin >> n;
vector<vector<int>> a(2,vector<int>(111));
for(i=0;i<n;i++){
cin >> a[0][i];
c+=a[0][i];
}
for(i=0;i<n;i++){
cin >> a[1][i];
}
c+=a[1][n-1];
int max=c;
for(i=n-1;i>0;i--){
c+... | 155 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(... | 284 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<functional>
using namespace std;
typedef long long int ll;
int main(){
int n;
cin >> n;
vector<int> a1, a2;
int a;
for(int i = 0; i < n; i++){
cin >> a;
... | 230 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pb push_back
#define mk make_pair
ll a[5][105],cu[2][105];
int main()
{
ll i,j,k,n,m;
cin>>m;
for(i=0; i<2; i++)
{
for(j=0; j<m; j++)
{
cin>>a[i][j];
}
}
cu[1][m-1]=a... | 256 |
Project_CodeNet | 2,018 | #include <cstdlib>
#include <iostream>
#include <iomanip>
#include <string>
#include <limits.h>
#include <math.h>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <typeinfo>
#include <stdlib.h>
#include <stack>
#include <queue>
#include <type_traits>
#define ll long long
#define ld lon... | 254 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;int n ,dp[3][102];
main(){cin >>n;for(int i = 1;i<3;i++) for(int j=1 ,a;j<=n;j++)cin >>a, dp[i][j] = max(dp[i-1][j],dp[i][j-1]) + a;cout<<dp[2][n];} | 86 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <tuple>
#include <string>
#include <functional>
#include <map>
#include <cstring>
using namespace std;
using ii = pair < int , int >;
using ti = tuple < int ,int ,int >;
using lint... | 290 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define all(x) x.begin(),x.end()
const ll mod = 1... | 280 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;
int a[2][101];
int main(){
int n;
cin>>n;
rep(i,n) cin>>a[0][i];
rep(i,n) cin>>a[1][i];
... | 185 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).be... | 474 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
int n;
int arr[2][maxn];
int dp[2][maxn];
int main() {
cin >> n;
for(int i = 0; i < 2; i++) {
for(int j = 0; j < n; j++) {
cin >> arr[i][j];
}
}
for(int i = n - 1; i >= 0; i--) {
dp[1][i] = arr[... | 235 |
Project_CodeNet | 2,018 | #include <stdio.h>
int a[2][128];
int d[2][128];
int n;
int main() {
scanf("%d", &n);
for(int i = 0; i < 2; i++) {
for(int j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
d[0][0] = a[0][0];
for(int i = 0; i < 2; i++) {
for(int j = 0; j < n; j++) {
if(i > 0) {
if( d[i][j] < d[i - 1][j] + a[i][j]) ... | 264 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define il inline
namespace io {
#define in(a) a = read()
#define out(a) write(a)
#define outn(a) out(a), putchar('\n')
#define I_int ll
inline I_int read() {
I_int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
... | 458 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
#define LL long long
#define INF 0x3f3f3f3f
const int MAXN = 1e2 + 5;
const LL MOD = 1e9+7;
int a[2][MAXN];
int main()
{
#ifndef ONLINE_JUDGE
//freopen("in.txt", "r", stdin);
#endif
int n;
cin >> n;
for(int i = 0; i < 2; i++)
... | 252 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a1(n), a2(n);
for(int i = 0; i < n; ++i){ cin >> a1[i]; }
for(int i = 0; i < n; ++i){ cin >> a2[i]; }
for(int i = 1; i < n; ++i){ a1[i] += a1[i - 1]; }
for(int i = n - 2;... | 190 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a1(n);
vector<int> a2(n);
for(int i = 0; i < n; ++i){
cin >> a1[i];
}
for(int i = 0; i < n; ++i){
cin >> a2[i];
}
... | 167 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
int x[3][110];
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&x[i][j]);
for(int i=2;i<=n;i++)
x[1][i]+=x[1][i-1];
for(int i=n-1;i>=1;i--)
x[2][i]... | 170 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int ... | 236 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <string>
#include <list>
#include <fstream>
#include <iomanip>
#include <array>
#include <map>
#include <queue... | 1,330 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int a[100], b[100];
for (int i = 0; i < n; i++)
cin >> a[i];
int k = a[0], m;
for (int i = 0; i < n; i++)
cin >> b[i], k += b[i];
m = k;
for (int i = 1; i < n; i++)
k += a[i] - b[i - 1], m = max(m, k);
cout << m << endl;
retur... | 134 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[2][111];
for(int i=0;i<2;i++)
for(int j=0;j<n;j++){
cin>>a[i][j];
}
int bc=0,cc=0;
int b[111]={},c[111]={};
for(int i=0;i<n;i++){
bc+=a[0][i];
cc+=a[1][n-1-i];
b[i]=bc;
c[i]=cc;
}
int ans=0;
f... | 173 |
Project_CodeNet | 2,018 | #include<iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
using namespace std;
int main()
{
// 整数の入力
long long N,K,i,a_i,result,temp;
cin >> N;
long long* number1 = new long long[N+1];
long long* number2 = new long long[N+1];
number1[0] = 0;
... | 196 |
Project_CodeNet | 2,020 | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,... | 1,187 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
int n, a[2][maxn], f[2][maxn];
int main() {
scanf("%d", &n);
for (int i = 0; i < 2; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", &a[i][j]);
f[i][j] = f[i][j - 1] + a[i][j];
if (i) f[i][j] = max... | 166 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int w[3][110], n, D[3][110];
int main() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= 2; i++)for (j = 1; j <= n; j++) {
scanf("%d", &w[i][j]);
D[i][j] = max(D[i - 1][j], D[i][j - 1]) + w[i][j];
}
printf("%d\n", D[2][n]);
} | 125 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int g1[120],g2[120];
int i,n,s;
int main()
{
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&g1[i]);
for (i=1;i<=n;i++)
scanf("%d",&g2[i]);
for (i=1;i<=n;i++)
g1[i]=g1[i]+g1[i-1];
for (i=n;i>0;i--)
g2[i]=g2[i]+g2[i+1];
for (i=1;i<=n;i++)
s=ma... | 158 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
using ll = long long;
int A[2][100];
int main() {
int N;
cin >> N;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int... | 209 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
//--------------------------... | 950 |
Project_CodeNet | 2,018 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmat... | 311 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
vector<ll> vec1, vec2;
ll n;
int main()
{
ios::sync_with_stdio(false);
... | 308 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,sfx[102],pfx[102],a[102],b[102];
int main()
{
cin >>n;
for (int i=0;i<n;i++)
cin>>a[i];
for (int i=0;i<n;i++)
cin >>b[i];
pfx[0]=a[0];
for (int i=1;i<n;i++)
{
pfx[i]=pfx[i-1]+a[i];
}
for (int i=n-1;i>=0;i--)
... | 182 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,gre... | 1,065 |
Project_CodeNet | 2,018 | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 299 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
using namespace std;
int main()
{
int a[2][100], n;
cin >> n;
for (int i = 0; i < 2; ++i)
for (int j = 0; j < n; ++j)
cin >> a[i][j];
for (int i = 0; i < 2; ++i)
for (int j = 0; j < n; ++j)
a[i][j] += max((i - 1 >= 0 ? a[i... | 173 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
int a[2][100];
int a1;
int x = 0;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a1;
if(i){
a[0][i] = a[0][i - 1] + a1;
}else{
a[0][i] = a1;
}
}
for(int i = 0;i < n;i++){
cin >> a1;
if(i){
a[1][i] = a[1][i - 1] + a... | 233 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
//freopen("input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[2][n];
for(int i = 0; i < n; i++) {
cin >> a[0][i];
}
for(int i = 0; i < n; i++) {
cin >> a[1][i];
}
in... | 239 |
Project_CodeNet | 2,018 | /*input
5
3 2 2 4 1
1 2 2 2 1
*/
#include <iostream>
typedef long long ll;
ll a[2][101];
int main() {
int n;
std::cin >> n;
for(int i = 0; i < 2; i++) {
for(int j = 1; j <= n; j++) {
std::cin >> a[i][j];
a[i][j] += a[i][j - 1];
}
}
ll ans = 0;
for(int j = 1; j <= n; j++) {
ans = std::max(ans, a[0]... | 178 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n;
int a[3][105];
int f[3][105];
int main()
{
scanf("%d",&n);
for(int j=1;j<=2;j++)
for(int i=1;i<=n;i++)
{
scanf("%d",&a[j][i]);
}
for(int i=1;i<=2;i++)
{
for(int j=1;j<=n;j++)
{
f[i][j]=max(f[i-1][j],f[i][j-1])+a[i][j];
}
}
cout<<f[2][n]<<endl;
ret... | 143 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int N;
cin >> N;
int can[2][N];
int u[N], d[N];
int sum;
int ans = 0;
u[0]=0; d[0]=0;
for(int i = 0; i < N; i++){
cin >> can[0][i];
if(i==0) u[i]=can[0][i];
else u[i]=... | 250 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int A1[101],A2[101];
int Sf1[102],Sb2[102],maxx=0;
int main()
{
int N;
cin>>N;
for (int i=0;i<N;i++)
{
cin>>A1[i];
}
for (int i=0;i<N;i++)
{
cin>>A2[i];
}
for (int i=1;i<=N;i++)
{
Sf1[i]=Sf1[i-1]+A1[i-1];
Sb2[i]=Sb2[i-1]+A2[N-i];
}
for (in... | 201 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int ... | 301 |
Project_CodeNet | 2,018 | //Kaori Miyazono, did I reach you ?
//"I can't die because... I'm the one who will protect you." -Asuna Yuuki
#include <bits/stdc++.h>
using namespace std;
const int N = 1100;
int nums[2][N];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
for(int i = 0; i < 2; i++) for(int j = 1; j <= n; j+... | 227 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> vec[2];
int n;
cin >> n;
vec[0].resize(n);
vec[1].resize(n);
int sum1 = 0, sum2=0,mx=0;
for (int i = 0; i < 2; i++)
{
sum2 = 0;
for (int j = 0; j < n; j++)
{
int t;
cin >> t;
vec[i][j] = t;
sum2 += t;
}
}
... | 202 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<string>
#include<vector>
#include<float.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<numeric>
using ll = long long;
using namespace std;
const ll M = 1000000007;
int main(){
int n, sum = 0, ans; ... | 232 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using Int = int64_t;
using UInt = uint64_t;
using C = std::complex<double>;
#define rep(i, n) for(Int i = 0; i < (Int)(n); ++i)
#define guard(x) if( not (x) ) continue;
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif
int main() {
Int n;
std::cin >> n;
std::vector<Int> xs(n),... | 253 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int N;
int a[2][100];
int main(){
cin>>N;
for(int i=0;i<2;i++){
for(int j=0;j<N;j++){
cin>>a[i][j];
}
}
int kotae = 0; // 全体の答え(最大値)
for(int x=0;x<N;x++){
int candies = 0; // 左からx列目で下に動いた時のキャンディの数
int gyou = 0; // 何行目にいるか
for(int j=0;j<N;j++... | 220 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;
int A[2][102];
int main(){
int N;
cin >> N;
for(int i=0;i<2;i++){
for(int j=0;j<N;j++){
cin >> A[i][j];
}
}
int ans = 0;
int c = 0;
for(int... | 169 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
using namespace std;
int can[2][101];
int dp[2][101];
int main(){
int N;
scanf("%d", &N);
for(int i=0; i<2; ++i){
for(int j=0; j<N; ++j)
scanf("%d", &can[i][j]);
}
for(int j=N-1; j>=0; --j){
dp[1][j] = can[1][j] + dp[1][j+1];
dp[0][j] = can[0][j] + max(dp[0][j+1], ... | 159 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define each(it,o) for(auto it= (o).begin(); it != (o).end(); ++ it)
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define inrep(t) int t;cin>>t; while(t--)
#define pb push_back
#define mp make_pair
using namespace std;
t... | 354 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std ;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define mem(x,val) memset((x),(val),sizeof(x))
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define PI acos(-1.0)
#define MAXN 11111
const int INF = 1 << 29 ;
typedef long long ll ;
ty... | 242 |
Project_CodeNet | 2,018 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author yassin
*/
#include <fstream>
#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstdlib>
#include <tuple>
#include <... | 341 |
Project_CodeNet | 2,018 | /*
_________________
____/:::::::::::::::::\_____
__/::::::::::::::::::::::::::::\___
_/:::::::::::::::::::::::::::::::::::\__
_/::::::::::::::::::::::::::::::::::::::::\_
/::::::::::::::::::::::::::::::::::::::::::::\
|::::::::::::::::::::::::::::::::::::::::::::::\
/:::::... | 1,097 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include<cctype>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#include<sstream>
#include<cstdlib>
#include<ctime>
#include<list>
#include<deque>
#include<bitset>
#include<fstream>
... | 319 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
#define REP(i,n) for(int i=0;(i)<(n);(i)++)
#define ll long long
int candies[2][102];
int calcDP(int n) {
i... | 338 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstdlib>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <string>
#include <unordered_map>
#include <iomanip>
#include <deque>
#include <unordered_set>
#incl... | 271 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<queue>
using namespace std;
#define ll long long
inline int read()
{
int x=0,t=1;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
... | 274 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int dp[123][123];
int arr[123][123];
int n;
int f(int l, int r) {
if (l < 0 || l > 2 || r < 0 || r > n) {
return 0;
}
if (dp[l][r] != -1) {
return dp[l][r];
}
return dp[l][r] = max(f(l + 1, r), f(l, r + 1)) + arr[l][r];
}
int main() {
scanf("%d", &n... | 211 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,s,e) for (int i=s;i<(e);i++)
#define All(v) (v).begin(),(v).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
using namespace std;
typedef long long llint;
typedef pair<int, int> P;
const int MOD = (int)1e9 + 7;
const int INF ... | 250 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define M 1005
#define ll long long
#define PI atan(1.0)*4
#define mst(x,v) memset(x,v,sizeof(x))
#define inf (int)1e9
#define rush() int T;scanf("%d",&T);while(T--)
typedef pair<int,int> P;
int n,m,ans... | 305 |
Project_CodeNet | 2,018 | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | 546 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(decltype(n) i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i,a,b) for(int i=(a);i>=(b);--i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(c) ((int)((c).size()))
#define st first
#define nd second
#define pb push_back
type... | 311 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
#include<cstring>
#define rep(i, s, t) for(i = s; i <= t; ++i)
#define dep(i, s, t) for(i = s; i >= t; --i)
using namespace std;
const int N = 110;
int n, ans;
int a[N], b[N], s1[N], s2[N];
int main() {
int i;
scanf("%d", &n);
rep(i, 1, n) scanf("%d", &a[i]);
rep(i, 1, n) sca... | 208 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(long long i=0;i<n;++i)
#define REPR(i,n) for(long... | 551 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pa... | 291 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
int n;
int sum = -1;
cin >> n;
int a[2][100];
for(int i = 0; i < n; i++) cin >> a[0][i];
for(int i = 0; i < n; i++) cin >> a[1][i];
for(int i = 0; i < n; i++){
int temp = 0;
for(int j = 0; j <= ... | 176 |
Project_CodeNet | 2,018 | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#define maxn 200010
using namespace std;
int n,a[2][maxn],ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
{scanf("%d",&a[0][i]);a[0][i]+=a[0][i-1];}
for(int i=1;i<=n;++i)
{scanf("%d",&... | 183 |
Project_CodeNet | 2,018 | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=LLONG_MAX;
const int inf=INT_MAX;
const int nmax=1e5+5;... | 285 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void){
int N,ans = 0;
cin >> N;
int A[2][N];
for(int i = 0;i < 2;i++){
for(int j = 0;j < N;j++){
cin >> A[i][j];
}
}
int up[N],down[N];
up[0] = A[0][0];
for(int i = 1;i < N;i++){
up[i] = up[i - 1] ... | 229 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using i64=int64_t;
#define rep(i,x,y) for(i64 i=i64(x),i##_max_for_repmacro=i64(y); i<i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
... | 416 |
Project_CodeNet | 2,018 | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define ... | 475 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
///////////////////////////////////////////
//const long long int INF = 1000000000000000000LL;
const long long int INF = 1000000;
using ll = long long int;
using vi = vector<int>;
using Vi = vector<long long int>;
#define pb push_back
#define all(x) (x)... | 469 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a[3][110],dp[3][110]={0};
cin >> n;
for (int i=1;i<=2;++i) {
for (int j=1;j<=n;++j) {
cin >> a[i][j];
}
}
dp[1][1] = a[1][1];
dp[2][1] = a[1][1] + a[2][1];
for (int i=1;i<=2;++i) {
for (int j=2;j<=n;++j) {
dp[i][j] = max(dp[i-1][j],dp[... | 184 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int N;
int okashi[2][110];
/*制限が緩いからDPを使う必要がない？*/
/*{(N-1)+1}C1通り((1,1)から(2,N)までたどり方)*/
int main(){
cin >> N;
for(int i = 0; i < 2; i++){
for(int j = 0; j < N; j++){
int v; cin >> v;
okashi[i][j] = v;
}
}
int maX = 0; int sum = 0;
f... | 272 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int n, a[104][2];
int main() {
cin >> n;
for (int i=0; i<2; i++) for (int k=0; k<n; k++) cin >> a[k][i];
for (int i=1; i<n; i++) a[i][0] += a[i-1][0];
for (int i=n-1; i; i--) a[i-1][1] += a[i][1];
int ans = 0;
for (int i=0; i<n; i++) ans = max(an... | 159 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define rrep(i,n) RFOR(i,n,0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
... | 195 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Candies
{
private:
std::vector<std::vector<int>> data;
int n;
public:
Candies ()
{
cin >> n;
data.resize(2);
for (auto &row : data)
{
row.resize(n);
for (int i=0; i<n; ++i)
{
cin >> r... | 275 |
Project_CodeNet | 2,020 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v... | 778 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.