Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
using namespace std;
typedef pair<int,int> pii;
int n;
int arr[2][1001];
int main() {
scanf("%d",&n);
for(int i=0;i<2;i++) for(int j=0;j<n;j++) scanf("%d",&arr[i][j]);
int mx=0;
for(int j=0;j<n;j++) {
... | 165 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define vll vector<ll>
#define G vector<vll >
#define F first
#define S second
#define pll pair<ll,ll>
#define RFOR(i,a,b) for(int i=a;i>=b;i--)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
... | 431 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
#include <complex>
#include <numeric>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,... | 342 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 1; i < n; i++... | 176 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//make_tuple emplace_back next_permutation push_back make_pair second first setprecision
using LL = long long;
constexpr LL LINF=334ll<<53;
constexpr int INF=15<<26;
constexpr LL MOD=1E9+7;
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
namespace Solver{
using names... | 309 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() {
cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest) {
cout << first << ' ';
print(res... | 283 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N, arr[3][105], dp[3][105];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 1; i <= 2; ++i){
dp[i][0] = 0;
for (int j = 1; j <= N; ++j){
cin >> arr[i][j];
dp[i][j] = arr[i][j] + max(dp[i-1][j],dp[... | 152 |
Project_CodeNet | 2,019 | #include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <cmath>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_polic... | 2,008 |
Project_CodeNet | 2,018 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author JustLive
*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#def... | 2,022 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <climits>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <tuple>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <iterator>
#include <re... | 378 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<string>
#include<set>
#include<vector>
using namespace std;
const int maxn = 1005;
typedef long long ll;
int a[2][maxn];
ll dp[2][maxn];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<=1;i++)
for(int j=1;j<=n;j++){
... | 192 |
Project_CodeNet | 2,018 | // C.
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[2][101] = {}, dp[2][101] = {};
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < n; ++j) {
cin >> a[i][j];
}
}
for (int j = n - 1; j >= 0; --j) {
... | 197 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i... | 531 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
bool done_something = false;
stringstream res;
res << "[";
for (; begin_iter... | 724 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
typedef long double ld;
// loop
//#define For(i, l, r, x) for (int i = l; i < r; i+=x)
//#define ForE(i, l, r, x) for (int i = l; i <= r; i+=x)
//#define Ford(i, r, l) for (int i = r; i > l; i--)
//#define FordE(i, r, l) for (... | 784 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#include<limits>
#include<bitset>
#include<functional>
#include<type_traits>
#include<queue>
#include<stack>
#include<array>
#include<random>
namespace lib
{
template<std::uint64_t Mod>struct modnum;
template<class ... | 2,694 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <deque>
using namespace std;
typedef long long ll;
typedef... | 237 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <fstream>
#include <map>
int main() {
int n;
std::cin >> n;
//in >> n;
std::vector<std::vector<int>> table(2, std::vector<int> (n, 0));
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < n;... | 240 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
int f[3][1010];
int main(){
int n,i,j,x;
scanf("%d",&n);
for(i=1;i<=2;i++)
for(j=1;j<=n;j++){
scanf("%d",&x);
f[i][j]=x+max(... | 126 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <cmath>
#include <queue>
#include <numeric>
int main()
{
long long n;
std::cin >> n;
std::vector<long long> v(n), v2(n);
for (size_t i = 0; i < n; i++)
{
std::cin >> v[i];
}
for (size_t i ... | 199 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
const int NMAX = 100 + 5;
int A[3][NMAX];
int main()
{
int N;
cin >> N;
for (int i = 1; i <= 2; ++ i)
for (int j = 1; j <= N; ++ j)
cin >> A[i][j];
int ans = -1;
for (int j = 1; j <= N; ++ j) {
int s = 0;
for (int k =... | 189 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int m[2][100];
int main()
{
int num;
scanf("%d", &num);
for (int i = 0; i < 2; i++)for (int j = 0; j < num; j++)scanf("%d", &m[i][j]);
int maxi = 0;
for (int i = 0; i < num; i++)
{
int t = 0;
for (int j = 0; j <= i; j++)t += m[0][j];
... | 168 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
const int N = 200;
int n;
int a[2][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){
a[1][i] += a[1][i - 1];
}
int ans = 0;
for(int i = n; i >= 1; --i){
a[2][i] += ... | 179 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n, a[4][102] = {}, ans = 0;
cin >> n;
for (int i = 1; i <= 2; i++) {
for (int j = 1; j <= n; j++) {
int in;
cin >> in;
a[i][j] += a[i][j - 1] + in;
}
}
for (int i = 1; i <= n; i++) ... | 169 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include "math.h"
#include <set>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)... | 279 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int mat[2][n];
for(int i=0;i<2;i++){
for(int j=0;j<n;j++){
cin>>mat[i][j];
}
}
int dp[2][n];
dp[0][0]=mat[0][0];
for(int i=1;i<n;i++){
dp[0][i]= mat[0][i]+dp[0][i-1];
}
... | 201 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define For(i, l, r) for(int i = (l), _end_ = (int)(r); i <= _end_; ++i)
#define Fordown(i, r, l) for(int i = (r), _end_ = (int)(l); i >= _end_; --i)
#define Set(a, v) memset(a, v, sizeof(a))
using namespace std;
bool chkmin(int &a, int b) {return b < a ? a = b, 1 : 0;}
bool chkmax(int &a, int... | 354 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a[3][123];
int dp[3][123];
main () {
int n; 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 <= n; i++) {
dp[1][i] = dp[1][i - 1] + a[1][i];
}
for (int i = 1; i <... | 188 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
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 dp[2][n];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < n; j++) {
if (i) {
if (j) {
dp[i][j] = max(dp[i - 1][j], d... | 263 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin>>N;
long long counter=0;
long long a[N]={};
long long b[N]={};
long long c[N]={};
long long d[N]={};
long long countera=0;
for(long long i=0;i<N;i++){
cin>>a[i];}
for(long long i=0;i<N;i++){
cin>>b[i];}
for(long long i=0;i<N;i++){
counter+=a[i]... | 178 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int f[4][20000],m[5][20000];
int main()
{
int n;
cin>>n;
for(int j=1;j<=2;j++)
for(int i=1;i<=n;i++)
scanf("%d",&m[j][i]);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=2;j++)
f[j][i]=max(f[j-1][i],f[j][i-1])+m[j][i];
}
cout<<f[2][n];
}
| 125 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
#include <map>
#include <stack>
#include <set>
#include <cmath>
#include <deque>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = ... | 261 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T> void chmin(T &a,T b){if(a>b) a=b;}
template<typename T> void chmax(T &a,T b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> a(n),b(n);
for(Int i=0;i<n;i++) cin>>a[i];
for(Int i=0;i<n;i++) cin>>b[i];
Int ans=... | 182 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int A[2][105];
int main(){
int n;
cin>>n;
int ans=0;
int sum=0;
for(int i=0;i<2;i++)
for(int j=0;j<n;j++) cin>>A[i][j];
for(int i=0;i<n;i++){
sum+=A[0][i];
int sum2=sum;
for(int j=i;j<n;j++) sum2+=A[1][j];
ans=max(a... | 143 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<algorithm>
using namespace std;
int candi[2][105]={0};
int dp[2][105]={0};
int main(){
int N;
scanf("%d", &N);
for(int i=0; i<N; i++){
scanf("%d", &candi[0][i]);
}
for(int i=0; i<N; i++){
scanf("%d", &candi[1][i]);
}
int sum=0;
for(int i=0; i<N; i++){
sum+=candi[0][i];
dp[0][i... | 207 |
Project_CodeNet | 2,018 | #include<iostream>
#include<array>
#include<vector>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <utility>
#include <set>
using llint = long long int;
using namespace std;
namespace CsF {
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define FOR(I,J,K) for(int I = 0;I < J;I+=K)
string... | 689 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <map>
#define ull unsigned long long int
#define ll long long int
#define rep(var, from, to) for (ll var=(from); var<=(to); var++)
#define INF (1<<30)
using namespace std;
int a[3][105];
int dp[2][105];
int main... | 284 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
//#include<cmath>
//#include<algorithm>
//#include<cstring>
//#include<map>
using namespace std;
inline int read()
{
int p=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9'){p=p*10+c-'0';c=getchar();}
return f*p;}
int N,a[1... | 228 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#defi... | 490 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <cstring>
#include <iomanip>
using namespace std;
int main(){
int N;
cin >> N;
int A[2][N];
int S[2][N+1];
memset(S,0,sizeof(S));
for(int i = 0 ; i <2; i++){
for(int j=0; j < N; j++){
cin >> A[i... | 185 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dx[4]={1,0};
int dy[4]={0,1};
int vis[3][102];
int n;
//int dfs(){
// for(int i=0;i<2;i++)
// {
// int x,y;
//
// }
//}
int main(){
while(scanf("%d",&n)!=EOF){
int mp[3][102];
for(int i=1;i<=2;i++)
... | 305 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#define pb push_back
#define mp make_pair
using namespace std;
const int N=1e3+5;
int n;
int a[3][N];
int prefix[N],suffix[N];
int ans;
int score(int col)
{
int res=0;
res=prefix[col] + suffix[co... | 249 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <... | 878 |
Project_CodeNet | 2,018 | #include <iostream>
int main()
{
int N;
std::cin >> N;
int arr[2][N];
int v[2][N];
for(int i=0; i<2; i++)
{
for(int j=0; j<N; j++)
{
std::cin >> arr[i][j];
}
}
for(int i=0; i<2; i++)
{
for(int j=0; j<N; j++)
... | 223 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,e) for(int i= 0; i< (int)(e); i++)
#define reps(i,s,e) for(int i = s; i < (int)(e); i++)
#define repr(i,s,e) for(int i = s; i > (int)(e); i--)
#define pb push_back
typedef long long ll;
const ll INF = 1LL << 60;
int main()
{
ll n;
cin >> n;
vector... | 270 |
Project_CodeNet | 2,018 | // Example program
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> vaul(2, vector<int>(n));
vector<vector<int>> dp(2, vector<int>(n, 0));
for (int j = 0; j < 2; ++j)
for (int i = 0; i < n; ++i)
cin >> vaul[j][i];
dp[0][0] = vaul... | 248 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define ss(x) scanf("%s",x)
#define mod 1000000007
#define bitcount __builtin_popcountll
#define ll long long
#define pb push_back
#define pi pair<int,int>
#define pii pair<pi,int>
#define mp make_pair
int a[10000... | 206 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff firs... | 331 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[102][3];
int mx=0;
void calc(int sum,int idx,bool top){
//cout<<idx<<' '<<sum<<' '<<top<<endl;
if(!top&&idx>=n){
mx=max(mx,sum);
return;
}
if(idx>=n)return;
if(top){
calc(sum+a[idx][0]+a[idx][1],... | 202 |
Project_CodeNet | 2,018 | /*
* Codetest.cpp
*
* Created on: 2018/01/21
* Author: Urakami
*/
#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef pair<int,int> pint;
typedef l... | 243 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#define int long lon... | 507 |
Project_CodeNet | 2,018 | #ifndef LOCAL
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
typedef long long ll;
typedef long long llong;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
/*
ll pw(ll a, ll b) {
ll ans = 1; while (b) {
while (!(b & 1)) b >>= 1, a = (a * a) % MOD;
ans = (ans * a) % MOD, ... | 303 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n],b[n];
int i,k,l;
int ue,sita;
int goukei[n];
int max=0;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(i=1;i<=n;i++)
{
cin>>b[i];
}
for(k=1;k<=n;k++)
{
g... | 236 |
Project_CodeNet | 2,019 | #include<bits/extc++.h>
#ifdef _debug
#define dout(i) cout << #i << ' ' << i << ' '
#else
#include<bits/stdc++.h>
#define dout(i) 0&&0
#endif
#pragma GCC optimize("unroll-loops,no-stack-protector,O3")
#define eout(i) {cout << (i) << '\n';exit(0);}
#define rout(i) {return cout << (i) << '\n', 0;}
#define priority_queu... | 631 |
Project_CodeNet | 2,018 | //A,Elebereth Gilthoniel mantae!
//For Temeria!
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<cstdio>
#include<map>
#include<stack>
#include<queue>
#include<cstring>
using namespace std;
int a[10][500];int s[10][500];
int main()
{
//freopen("","r",std... | 255 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int gr[2][n];
for (int i=0; i<2; i++) for (int j=0; j<n; j++) cin >> gr[i][j];
int best[2][n];
best[0][0] = gr[0][0];
for (int i=1; i<n; i++) {
best[0][i] = best[0][i-1] + gr[0][i];
}
best[1][0] = gr[0][0] + gr[1][0];
for (int ... | 202 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <iostream>
#include <string>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <ctime>
#include <queue>
#include <deque>
#include <math.h>
#include <cmath>
#include <stack>
#include <alg... | 411 |
Project_CodeNet | 2,018 | // {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | 313 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <math.h>
using namespace std;
#define INF (1<<31-1)
#define ll long long
int N;
int a[2][101];
int main(){
cin >> N;
for (int i = 0; i < N; i++){
cin >> a[0][i];
}
for (int i = 0; i < N; i++){
cin >> a[1][i];
}
int result... | 210 |
Project_CodeNet | 2,018 | //在 POJ 和小白菜中，该库禁用！
//在 USACO中请用文件。
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cstdlib>
using namespace std;
typedef long long ll;
int n,a[3][105],dp[3][105];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=2;i++... | 216 |
Project_CodeNet | 2,018 | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <math.h>
#include <climits>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
... | 256 |
Project_CodeNet | 2,018 | #ifndef LOCAL
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#define _SCL_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#define push_back pb
#define make_pair mp
#define first x
#define second y
#include <cassert>
#include <c... | 1,908 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[2][111];
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){
if(i&&j)a[i][j]=max(a[i-1][j],a[i][j-1])+a[i][j];
... | 178 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
int pre[n+1];
pre[0]=0;
for(int i=0; i<n; ++i) cin>>pre[i+1], pre[i+1]+=pre[i];
int suff[n+2];
for(int i=0; i<n; ++i) cin>>suff[i+1];
suff[n+1]=0;
for(int i=n; i>0; --i) suff[i]+=suff[i+1];
int res = 0;
for(int i=1; i<=n; ++i) res=max(res, pre[i]+s... | 149 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0)... | 249 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
// nichijou
#define REP(i,a,b) for (int i(a); i < (b); ++i)
#define RP(i,n) REP(i,0,n)
#define PER(i,a,b) for(int i((a)-1); i >= (b); --i)
#define PR(i,n) PER(i,n,0)
#define REP1(i,a,b) REP(i,a,(b)+1)
#define RP1(i,n) REP1(i,1,n)
#define PER1(i,a,b) PER(i,(a)+1,b)
#define P... | 1,004 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int cols;
cin >> cols;
vector<vector<int>> mat(2, vector<int>(cols));
for (auto &row : mat) {
for (auto &num : row) {
cin >> num;
}
}
for (size_t i = 0; i < mat.size(); i += 1) {
for (... | 206 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <str... | 349 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
#include <fstream>
#include <cstdint>
#include <cmath>
#include <algorithm>
#include <utility>
#include <numeric>
#include <functional>
using namespace std;
constexpr int INF = 1000000000;/* ... | 325 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
u... | 314 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const int INF = 1000010000;
static const int NIL = ... | 833 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,ans;
int a[1010],b[1010];
void solve(){
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i];
for(int i=1;i<=n;++i)cin>>b[i];
for(int i=1;i<=n;++i)a[i]+=a[i-1];
for(int i=n;i;--i)b[i]+=b[i+1];
for(int i=1;i<=n;++i)
ans=max(ans,a[i]+b[i]);
cout<<ans<<endl;
}
int main(){
sol... | 139 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
using namespace std;
typedef long long int lli;
int main() {
int N;
cin >> N;
vector<vecto... | 246 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <bitset>
#include <sstream>
#include <cstdlib>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <climits>
#i... | 1,050 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
typedef long long i64;
const int inf = (int)1.05e9;
int main()
{
int n;
vector<int> as, bs;
scanf... | 237 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int n,a[2][100];
int main()
{
cin>>n;
for (int i=0;i<n;i++){
cin>>a[0][i];
if (i) a[0][i]+=a[0][i-1];
}
for (int i=0;i<n;i++){
cin>>a[1][i];
int v=a[0][i];
if (i) v=max(v,a[1][i-1]);
a[1][i]+=v;
}
cout<<a[1][n-1]<<endl;
return 0;
} | 138 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include <sstream>
#includ... | 286 |
Project_CodeNet | 2,020 | // Date: 2020-08-28
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define IO freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout)
#define FIO ios::sync_with_stdio(false);cin.tie(0);cout... | 516 |
Project_CodeNet | 2,018 | #include<cstdio>
int a[5][105],f[5][105];
int max(int x,int y) {return x>y?x:y;}
int main()
{
int n;scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[1][i]);
for(int i=1;i<=n;i++) scanf("%d",&a[2][i]);
for(int i=1;i<=n;i++) f[1][i]=f[1][i-1]+a[1][i],f[2][i]=max(f[1][i],f[2][i-1])+a[2][i];
printf("%d\n",f[2][n]);... | 158 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int n, ara[4][105];
int solve(int i, int j) {
if(i > 2 || j > n)
return 0;
if(i == 2) {
if(j == n) {
return ara[i][j];
}
return ara[i][j] + solve(i, j + 1);
}
int k = m... | 207 |
Project_CodeNet | 2,018 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;
typedef double LD;
typedef long long LL;
typedef pair<int, int> PII;
#define MP make... | 401 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int n,i;
int *p, *h;
cin>>n;
p=new int [n];
h=new int [n];
for(i=0; i<n; ++i) cin >> i[p];
for(i=0; i<n; ++i) cin >> i[h];
int *piyo,*hoge;
piyo=new int [n];
hoge=new int [n];
0[piyo] = 0[p];
(n-1)[hoge] = (n-1... | 272 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<int,int>> a(n,pair<int,int>(0,0));
for(int j=0;j<n;j++){
cin >> a[j].first;
if(j!=0){
a[j].first = a[j-1].first + a[j].first;
}... | 187 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
template <typename T> T lcm(T x, T y) {
if (x == 0 || y == 0)
return 0;
return x / gcd(x, y) * y;
}
int main() {
int N;
cin >> N;
vector<vector<int>> A(2, vector<... | 288 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-8;
typedef pair<int, int> p... | 399 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
#include <stack>
#include <vector>
#define INF 0x3f3f3f3f
#define MOD 1000000009
# define FOR(i,a,n) for(register int i=a; i<=n; ++i)
# define... | 389 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
templ... | 552 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >>N;
vector<int> A(N,0),B(N,0),X(N,0),Y(N,0);
for(int i=0; i<2; i++){
for(int j=0; j<N; j++){
int a;
cin >>a;
if(i==0) A[j]=a;
else B[j]=a;
}
}
X=A, Y=B;
for(int i=0; i<N-1; i++){
X[i+1]+=X[i];
Y[i... | 218 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
#define REP(i, x, n) for(lint i = x ; i < n ; i++)
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for(lint i = n - 1 ; i >= 0 ; i--)
#define SORT(c) sort((c).begin(), (c).end())
const int IINF = 1e9 + 10;
const lint LLINF = (lint)1e18 + 10;
const... | 385 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> f = vector<int>(n, 0);
vector<int> s = vector<int>(n, 0);
int sumtmp = 0;
for (int i = 0; i < n; ++i)
{
int tmp;
cin >> tmp;
sumtmp += tmp;... | 233 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a[2];
for (int i = 0; i < 2; i++) {
a[i] = vector<int>(n);
}
for (int i = 0; i < 2; i++) {
... | 228 |
Project_CodeNet | 2,018 | #include <cstdio>
int N;
int M=2;
int A[110][110];
int memo[110][110];
void solve()
{
int i, j;
memo[0][0] = A[0][0];
for(i=0; i<M; i++){
for(j=0; j<N; j++){
if(i+1<M){
if(memo[i+1][j] < memo[i][j]+A[i+1][j])
memo[i+1][j] = memo[i][j]+A[i+1][j];
}
if(j+1<N){
if(memo[i][j+1] < memo[i][j]+A[i... | 256 |
Project_CodeNet | 2,018 | #include"bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> A(2, vector<int>(N));
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++) {
cin >> A[i][j];
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
int tmp = 0;
... | 184 |
Project_CodeNet | 2,018 | #include<cstdio>
using namespace std;
const int N=110;
int n,m,a[N][N],f[N][N];
inline int max(int x,int y) {return x>y?x:y;}
int main()
{
n=2; scanf("%d",&m);
for (int i=1; i<=n; ++i) for (int j=1; j<=m; ++j)
scanf("%d",&a[i][j]);
f[1][1]=a[1][1];
for (int i=1; i<=n; ++i) for (int j=1; j<=m; ++j)
f[i][j]=max... | 175 |
Project_CodeNet | 2,018 | #include <cstdio>
#define max(a,b) ((a>b)?a:b)
int n,a[2][102],ans=0,t;
int main(){
scanf("%d",&n);
for(int i=0;i<2;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
a[0][0]=0;
for(int i=1;i<=n;i++)
a[0][i]+=a[0][i-1];
t=0;
for(int i=n;i>0;i--){
t+=a[1][i];
ans=max(ans,t+a[0][i]);
}
printf("%d\n",ans)... | 145 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define pb push_back
#define ins insert
#define F first
#define S second
#define var auto
using namespace std;
typedef long long ll;
const int Max = 1e5 + 10;
const int Mod = 1e9 + 7;
int A[3][Max];
ll dp[3][Max];
int main()
{
int n;cin >> n;
for(int i = 1; i <= n ; i++)
cin >> A[1][i];
... | 216 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
cin >> n;
int gr[2][n];
for (int i=0; i<2; i++) for (int j=0; j<n; j++) cin >> gr[i][j];
int best[2][n];
best[0][0] = gr[0][0];
for (int i=1; i<n; i++) {
best[0][i] = best[0][i-1] + gr[0][i];
}
best[1][0] = gr[0][0] + gr[1][0];
for (int ... | 202 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int n,a[2][100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", a[0] + i);
for (int i = 0; i < n; i++)
scanf("%d", a[1] + i);
for (int i = 1; i < n; i++) {
a[0][i] += a[0][i-1];
a[1][n-i-1] += a[1][n... | 192 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <sstream>
#include<set>
#include<stack>
//#includ... | 273 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll,ll>
#define vpii vector<pair<ll,ll> >
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a,i) memset(a,i,sizeof(a)... | 891 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.