Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w
#define i... | 423 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>arr1(n+1,0);
vector<int>arr2(n+1,0);
for(int i=1; i<=n; i++){
cin>>arr1[i];
arr1[i]+=arr1[i-1];
}
for(int i=1; i<=n; i++){
cin>>arr2[i];
arr2[i]+=arr2[i-1];
}
int mx = 0;
for(int i=1; i<... | 161 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#define FOR(i, l, r) for(int i = l; i <= r; ++i)
using namespace std;
int n, m, a[110][110];
int main()
{
scanf("%d", &m);
FOR(i, 1, 2) FOR(j, 1, m) scanf("%d", &a[i][j]);
FOR(i, 1, 2) FOR(j, 1, m) a[i][j] += max(a[i - 1][j], a[i][j - 1]);
printf("%d\n", a[2][m]... | 143 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000;
int a[MAXN], b[MAXN], sa[MAXN], sb[MAXN];
int ans, n;
int main() {
cin >> n;
for (int i=1; i<=n; i++) {
cin >> a[i];
sa[i] = sa[i-1] + a[i];
}
for (int i=1; i<=n; i++) {cin >> b[i]; sb[i]=sb[i-1]+b[i];}
for (int i=1; i<=n; i++)
ans = max(a... | 150 |
Project_CodeNet | 2,018 | #include <cstdio>
using namespace std;
int p[102];
int main(){
int N; scanf("%d", &N);
for(int i = 1, s = 0; i <= N; i++){
int x; scanf("%d", &x);
s += x; p[i] = s;
}
int ans = 0;
for(int i = 1; i <= N; i++){
int x; scanf("%d", &x);
ans = (p[i] > ans ? p[i] : ans) + x;
}
printf("%d\n... | 137 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int , int> pii;
const int N = 110;
int l[3][N] , r[3][N] , a[3][N];
int main(){
ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
int n , ans = 0;
ci... | 244 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <string.h>
#define MAX_N 105
using namespace std;
int n,ans=0;
int a[MAX_N];
int b[MAX_N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]+=a[i-1];
for(int i=1;i<=n;i++) scanf("%d",&b[i]),b[i]+=b[i-1];
for(int i=1;i<=n;i++) ans=max(ans,a[i... | 133 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int n,a[105],b[105];
int main()
{
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
int ans=-1;
for(int i=0;i<n;i++)
{
int sum=0;
for(int j=0;j<n;j++)
if(j<i)
sum+=a[j];
else
if(j==i)
s... | 145 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n, a[105], b[105];
int ans;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i], a[i] += a[i - 1];
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;... | 160 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector <int> v1(n);
vector <int> v2(n);
for (int i = 0; i < n; i++) {
cin >> v1.at(i);
}
for (int i = 0; i < n; i++) {
cin >> v2.at(i);
}
int64_t ans = 0;
for (int i = 1; i <= n; i++) {
int tmp = 0;
for (int... | 204 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n;
int a[2][100];
int dp[2][100];
int main(){
cin >> n;
rep(i, 2){
rep(j, n){
cin >> a[i][j];
}
}
dp[0][0] = a[0][0];
dp[1][0] = a[0... | 239 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
int main() {
int N, A[2][101] = {}, a;
cin >> N;
REP(i, 2) REP(j, N) {
cin ... | 197 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
//#include "util.k"
using namespace std;
//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__)
typedef unsigned uint; typedef long... | 1,189 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
const int maxn=105;
int a[2][maxn];
int dp[2][maxn];
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]);
for(int j=0;j<n;j++){
for(int i=0;i<2;i++){
dp[i][j]=a[i][j];
if(i>0)dp[i][... | 191 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
const int M = 110;
const int N = 2;
int grid[N][M];
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
const int I[] = {+1, +0};
const int J[] = {+0, +1};
bool vis[N][M];
//int run(int i, int j) {
// priority_queue<iii> q;
//
// q.push(iii(grid[i][j], i... | 516 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define gc getchar
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define x1 uvuvwevwevwe
#define y1 onyetenyevwe
#define x2 ugwemubwem
#define y2 ossas
typedef long long LL;
typedef ... | 400 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | 401 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[210][210];
int main()
{
int m;
... | 177 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <climits>
#include <cmath>
#include <algorithm>
#include <cassert>
#define TEST_ASSERT(msg, cond) do { if (cond) { cou... | 303 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<string>
#include<sstream>
#include<iomanip>
#include<utility>
#include<cmath>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstring>
#include<iterator>
... | 682 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
#include<string>
#include<stack>
#include<string.h>
#include<memory.h>
#include<algorithm>
#include<vector>
int a[4][103];
int dp[4][103];
int main()
{
int i,j,n;
cin>>n;
for(i=1;i<=2;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
dp[i][j]=a[i][j]+max(dp[i-1][j],dp[i][j-1])... | 132 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MOD=1000000007;
typedef long long int ll;
int gcd(int a,int b)
{
if (b==0) return a;
return gcd(b,a%b);
}
template<class T,class K>
pair<T,K> mp(T a,K b)
{
return make_pair(a,b);
}
ll mult(ll a,ll b)
{
return (a*b)%MOD;
}
ll pot(ll n,ll k)
{
if (k==0) r... | 353 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[2][105], dp[2][105];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = ... | 228 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int a[300],b[300];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
a[i]+=a[i-1];
}
for(int i=1;i<=n;i++)
{
int y;
cin>>y;
b[i]=max(b[i-1],a[i])+y;
}
cout<<b[n];
return 0;
} | 107 |
Project_CodeNet | 2,018 | /* Mere paradesiyaan ki yahi hai nishaani
Ankhiyaan bilor ki, shishe ki jawaani
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define LOG1(a) cerr<< #a << " = " << (a) << "\n"
#define LOG2(a, b) cerr<< #a << " = " << (a) << ", "... | 368 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int n,a[110]={0},b[110]={0};
cin >> n;
for(int i=1; i<=n; i++) {
cin >> a[i];
a[i]+=a[i-1];
}
for(int i=1; i<=n; i++) {
int c;
cin >> c;
b[i]=max(b[i-1],a[i])+c;
}
cout << b[n] << endl;
}
| 119 |
Project_CodeNet | 2,018 | // see https://github.com/LumaKernel/vimfiles/tree/master/snippets/cp-cpp/temp.snip
/// --- .lumrc Template {{{ ///
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = tuple<ll, ll>;
using P3 = tuple<ll, ll, ll>;
using VI = vector<int>;
... | 1,108 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec1 (N);
vector<int> vec2 (N);
int total = 0;
for(int i = 0;i < N;i++){
cin >> vec1.at(i);
total += vec1.at(i);
}
for(int i = 0;i < N;i++){
cin >> vec2.at(i);
total += vec2.at(i);
}
vector<int> vec (N);
for(in... | 197 |
Project_CodeNet | 2,019 | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
int main() {
ll n;
ll a[101],b[101];
std::cin >> n;
ll suma[102],sumb[102];
suma[0] = 0;
sumb[... | 246 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include<tr1/unordered_map>
#define mem(a,b) memset(a,b,sizeof a)
#define For(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define rFor(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
using namespace std;
typedef long long LL;
const int N=1000;
const int inf=0x3f3f3f3f;
template<typename T>inline bool... | 364 |
Project_CodeNet | 2,018 | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x+... | 1,307 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<vector<int>> a(3, vector<int>(n + 1, 0));
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
a[i][j] += max(a[i - 1][j], a[i][j - 1]);
}
}
cout << a[2][n]... | 137 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i ... | 488 |
Project_CodeNet | 2,018 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author majk
*/
#ifndef MAJK_LIB
#define MAJK_LIB
#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#incl... | 1,366 |
Project_CodeNet | 2,018 | #include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<sstream>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algor... | 301 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <utility>
#include <cstdlib>
#include <memory>
#include <queue>
#include <cassert>
#include <cmath>
#include <ctime>
#include <complex>
#include <bitset>
#include <fst... | 662 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define clr(v,d) memset( v, d ,sizeof(v))
#define angle(n) ... | 735 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1000;
int a[3][maxn], b[maxn], c[maxn];
int n;
int main()
{
cin>>n;
for(int i = 1; i <= 2; i++)
for(int j = 1; j<= n; j++)
cin>>a[i][j];
for(int i = 1; i <= n; i++) b[i] = b[i-1] + a[1][i];
... | 173 |
Project_CodeNet | 2,018 | #include <cstring>
#include <cstdint>
#include <iostream>
#include <string>
#include <memory>
#include <queue>
#include <limits>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <utility>
#include <sstream>
#include <random>
#include <functional>
#include<algorith... | 264 |
Project_CodeNet | 2,018 | #include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
//#include <chrono> //1e+9で割る auto end= chrono::system_clock::now()-st; cout<<end.count()%1e+9<<endl;
using namespace std;
typedef long long l... | 301 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define SZ(a) int((a).size())
#define REP(i,n) for(int i=0,_n=(n);i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
typedef long long llong;
typedef vector<int> VI;
typedef vector<VI> VVI... | 287 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e6+3)
#define INF... | 337 |
Project_CodeNet | 2,018 | #include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <stack>
#include <limits>
#include <climits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include... | 1,283 |
Project_CodeNet | 2,018 | /* Bismillahirrahmanirrahim */
/* Author : Jehian Norman Saviero (@Reiva5) */
#include <bits/stdc++.h>
/* MACROS SAMPAH */
#define Jehian using
#define Norman namespace
#define Saviero std
#define cepet {ios_base::sync_with_stdio(0);cin.tie(0);}
Jehian Norman Saviero;
/* MACROS FOR TYPE */
typedef long l;
typedef lo... | 749 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
#define maxN 111
int n, i, j;
int a[5][maxN], dp[5][maxN];
int main()
{
// freopen("test.in","r",stdin);
cin >... | 210 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i=0;i<(int)n;i++)
#define FOB(i,n) for(int i=n;i>=1;i--)
#define MP(x,y) make_pair((x),(y))
#define ii pair<int, int>
#define lli long long int
#define ulli unsigned long long int
#define lili pair<lli, lli>
#ifdef EBUG
#define DBG if(1)
#else
#def... | 613 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int N,fields[2][200];
int max(int x,int y){
return x>y?x:y;
}
int main(){
cin >> N;
for(int i=0 ; i<2 ; i++ )
for(int j=0 ; j<N ; j++ )
cin >> fields[i][j];
fields[1][N]=fields[0][N]=0;
int m=0;
... | 179 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
using namespace std;
int n,m,i,j,k,a[110][110],f[110][110];
int main(){
scanf("%d",&n);
for(i=1;i<=2;i++)
for (j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for (i=1;i<=2;i++)
for (j=1;j<=n;j++)
f[i][j]=max(f[i-1][j],f[i][j-1])+a[i][j];
printf("%d",f[2][n]);
return 0;
} | 130 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define MAXN 101
using namespace std;
int n, A[2][MAXN], V[2][MAXN];
int main() {
cin >> n;
for(int i = 0; i < 2; ++i) {
for(int j = 0; j < n; ++j) {
cin >> A[i][j];
}
}
V[0][0] = A[0][0];
for(int j = 1; j < n; ++j) {
V[0][j] = A[0][j... | 273 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi... | 414 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define REP2(i,n) for(int i=0;i<(int)(n);i++)
#define REP3(i,m,n) for(int i... | 803 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define LL long long
using namespace std ;
void Read ( int &x, char c = getchar(), bool f = 0 ) {
for ( x = 0 ; !isdigit(c) ; c = getchar() ) f = c=='-' ;
for ( ; isdigit(c) ; c = getchar() ) x = 10*x + c - '0' ;
if (f) x = -x ;
}
const int maxn = 105 ;
int n, m, a[maxn][5], f[maxn][5] ;
int... | 256 |
Project_CodeNet | 2,018 | /*
ID: bradyawn
PROG: contest
LANG: C++11
*/
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <fstream>
#include <vector>
#include <deque>
#include <string>
#include <cmath>
#include <map>
#include <utility>
#include <algorithm>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
... | 323 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <vector>
#include <stack>
#include <iostream>
#include <string>
#include <tuple>
#include <random>
#include <map>
#include <queue>
#include <set>
#include <complex>
#include <algorithm>
#include <cassert>
#include <iterator>
#include <numeric>
using namespace std;
typedef long double ld;
ty... | 331 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#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 VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()
#define PII pair<int,int>
#define mp make_pair
#define st... | 651 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#ifdef grief
#define IOS
#define debug(...) do{\
fprintf(stderr,"%s - %d : (%s) =",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
_DO(__VA_ARGS__);\
}while(0)
template<typename I> void _DO(I&&x){cerr<<x<<'\n';}
template<typename I,typename ...T> void _DO(I&&x,T&&...tail){ce... | 275 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
long long dp[3][200];
long long mat[3][200];
int main()
{
int n;
scanf("%d",&n);
for(int i = 1 ; i <= 2 ; i++)
{
for(int j = 1; j <= n ; j++)
{
scanf("%lld",&mat[i][j]);
}
}
dp[1][1] = mat[1][1];
for(int i = 1; i <= 2; i++)
{
for(int j = 1; j <= n ; j++)
... | 273 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<algorithm>
using namespace std;
int n,m,f[1000][1000];
int main(){
scanf("%d", &m); n=2;
for(int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x;
scanf("%d", &x);
f[i][j] = max(f[i-1][j], f[i][j-1]) + x;
}
}
printf("%d\n", f[n][m]);
}
| 119 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <unordered_set>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
int n;
int a[2][101];
int t[2][101];
int main(void)
{
cin >> ... | 282 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#ifdef PRINTERS
#include "printers.hpp"
using namespace printers;
#define tr(a) cerr<<#a<<" : "<<a<<endl
#else
#define tr(a)
#endif
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector... | 348 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define il inline
#define RG register
#define ll long long
using namespace std;
int a[2][105],f[2][105],n;
il int gi(){
RG int x=0,q=1; RG char ch=getchar();
while ((ch<'0' || ch>'9') && ch!='-') ch=getchar();
if (ch=='-') q=-1,ch=getchar();
while (ch>='0' && ch<='9') x=x*10+ch-'0',c... | 212 |
Project_CodeNet | 2,018 | # include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stac... | 545 |
Project_CodeNet | 2,018 | #include <stdio.h>
int max(int a, int b) {
return a > b ? a : b;
}
int main() {
int arr[2][110];
int i, j;
int n;
int f[110][2];
scanf("%d", &n);
for (i = 0; i < 2; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &arr[i][j]);
}
}
f[0][0] = arr[0][0];
f[0][1] = arr[0][0] + arr[1][0];
for (i = 1; i < ... | 231 |
Project_CodeNet | 2,019 | #include <algorithm> //STLͨ���㷨
#include <cmath> //������ѧ����
#include <cstdio> //��������/�������
#include <iostream> //����������/���
#include <cstring> //�ַ�������
#include <string> //�ַ�����
#include <ctime> //�������ʱ��ĺ���
#define itn int
#define fro for
#define ll long long
#define reg register
#define inf 1234... | 1,089 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
inline long long read();
using namespace std;
int mapp[4][105],mx[4][105];
int main()
{
int n=read();
for(int j=1;j<=2;j++)
for(int i=1;i<=n;i++)
{
mapp[j][i]=read();
}
for(int i=2;i>=1;i--)
{
for(int j=n;j>=1;j--)
{
mx[i][j]=max(mx[i+1][j],mx[i][j+1])+mapp[i][j];
}
}
cout<<... | 216 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
using namespace std;
int n,e[1001][1001],dp[1001][1001];
int main(){
scanf("%d",&n);
for(int i=1;i<=2;i++){
for(int j=1;j<=n;j++){
scanf("%d",&e[i][j]);
}
}
for(int i=1;i<=2;i++){
for(int j=1;j<=n;j++){
dp[i][j]=max(dp[i... | 145 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
//#define int long long
int main(){
int N;
int a[2][110];
int Ans=0;
int sum=0;
cin >> N;
REP(i,2){
REP(j,N){
cin >> a[i][j];
}
}
REP(i,N){
sum=0;
REP(j,... | 161 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#define ll long long
#define md 1000000007
using namespace std;
long long n;
int main(){
cin>>n;
vector<vector<int> > a(2, vector<int>(n));
vector<vector<int> > s(2, vector<int>(n,0));
for(int i=0; i<2; i++)
... | 238 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#define pb push_back
#define mp make_pair
using namespace std;
template<typename T>inline void upmi... | 330 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n;
int M[2][105],dp[2][105];
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
while(cin >> n)
{
for(int i = 0; i < 2; i++)
for(int j = 0; j < n; j++)
cin >> M[i][j];
memset(dp, 0, sizeof dp);
... | 226 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii... | 821 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), s1(n+1, 0), s2(n+1, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
s1[i+1] = s1[i] + a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
s2[i+1] = s2[i] + b[i];
... | 200 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& op... | 310 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int n, a[2][210], b[2][210] = {};
cin >> n;
for (int i = 0; i < 2; i++) {
cin >> a[i][0];
b[i][0] = a[i][0];
for (int j = 1; j < n; j++) {
cin >> a[i][j];
b[i][j] = b[i][j - 1] + a[i][j];
}
}
int ans = -1;
for (int i = 0; i < n; i++) {
if (ans <... | 219 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
#define mo 1000000007
using namespace std;
int n;
int a[5][105];
int f[5][105];
int main(){
scanf("%d",&n);
for (int i=1;i<=2;i++)
for (int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
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]... | 143 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cassert>
#include <queue>
#include <deque>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
#include <cstdlib>
#include <string>
#include <unordered_map>
#include <sstream>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
t... | 249 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long int ll;
#define INF 10000000000000
using namespace std;
int main()
{
int N;
int A[2][100];
int sum_u, sum_l, max;
sum_u = sum_l = max = 0;
cin >> N;
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; ... | 220 |
Project_CodeNet | 2,018 | #include <map>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <vector>
#include <stdio.h>
#include <fstream>
#include <iostream>
#include <string.h>
#include <limits.h>
#include <algorithm>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define N 100010
#... | 265 |
Project_CodeNet | 2,018 | #include <cstdio>
int a[101];
int b[101];
int main() {
int i, n, r = 0;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
a[i] += a[i - 1];
}
for (i = 1; i <= n; i++) {
scanf("%d", &b[i]);
b[i] += b[i - 1];
}
for (i = 1; i <= n; i++) {
if (r < a[i] + b[n] - b[i - 1]) r = a[i] + b[n] - b... | 170 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <algorithm>
#include <map>
#define rep(i, N) for(int (i) = 0; (i) < (N); (i) ++)
typedef long long ll;
using namespace std;
int main(){
int N;
cin >> N;
vector<int> us(N, 0);
vector<int> ds(N, 0);
r... | 287 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
#endif
}
int n, DP[5][110];
int main() {
//Boost();
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> DP[1][i];
for(int i = 1; i <= n... | 215 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
typedef long long ll;
const int mod = 1e9 + 7;
#define X first
#define Y second
int sa[MAXN], sb[MAXN];
int main()
{
//freopen("input", "r", stdin);
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &sa[i]);
for (int i = 1; ... | 224 |
Project_CodeNet | 2,018 | // #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>... | 328 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define pdi pair<db,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define eps 1e-8
#define mo 974711
#define MAXN 1000005
//#define ivorysi
using namespace std;
typedef long long... | 448 |
Project_CodeNet | 2,018 | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3","sse2","sse")
#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma GCC target("f16c")
#pragma GCC optimi... | 980 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ii pair<int,int>
#define iii pair<ii,int>
#define vii vector<pair<int,int> >
#define vi vector<int>
#define vvi vector<vector<int> >
#define vs vector<string>
#define pb push_back
#define mp make_pair
#define fi first
... | 324 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include<cstdio>
#include<cstring>
using namespace std;
typ... | 383 |
Project_CodeNet | 2,018 | #include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <iomanip>
#include <bitset>
using name... | 313 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,a[3][201],dp[2][201];
int main()
{
scanf("%d",&n);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(int i=1;i<=2;i++)
for(int j=1;j<=n;j++)
dp[i][j]=max(dp[i-1][j],dp[i][j-1])+a[i][j];
printf("%d\n",dp[2][n]);
return 0;
} | 129 |
Project_CodeNet | 2,018 | #include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b... | 863 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeo... | 769 |
Project_CodeNet | 2,020 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#inclu... | 696 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) fo... | 703 |
Project_CodeNet | 2,018 | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unorde... | 432 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#incl... | 284 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int A[101][101];
int N;
int Func(int x, int y){
if(x == 0 && y == 0){
return A[0][0];
}
int res = A[y][x];
if(x != 0){
res = A[y][x] + Func(x - 1, y);
}
if(y != 0){
res = max(res, A[y][x] + Func(x, y - 1));
... | 196 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int n,a[20][105];
cin>>n;
for (int i=0;i<=2;i++)
for (int j=0;j<=n;j++)
a[i][j]=0;
for (int i=1;i<=2;i++)
for (int j=1;j<=n;j++)
{
cin>>a[i][j];
}
for (int i=1;i<=n;i++)
a[1][i]=a[1][i]+a[1][i... | 190 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=105;
int n,a[3][N],f[3][N];
int main(){
//freopen("aa.in","r",stdin);
int i,j;
scanf("%d",&n);
for(i=1;i<=2;++i)for(j=1;j<=n;++j)scanf("%d",&a[i][j]);
for(i=2;i;--i)for(j=n;j;--j)f[i][j]=max(f[i+1][j],f[i][j+1])+a[i][j];
printf("%d",f... | 146 |
Project_CodeNet | 2,018 |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005
ll mod(ll a){
ll ... | 298 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define IN freopen("input.txt","r",stdin)
#define OUT freopen("output.txt","w",stdout)
#define pf printf
#define sf scanf
#define pb push_back
#define MAX5 100005
#define MAX6 1000005
#define MAX7 10000005
#define FOR(i,n) for(i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#d... | 423 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.