Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define N 2005
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(),v.end()
using namespace std;
ll n;
vector< pair< ll , ll > > ar;
ll dp[N][N];
ll rec(ll l, ll r){
if(l>r)return 0;
if(dp[l][r]!=-1)return dp[l][r];
int in = l-1 + n - r;... | 249 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// clang-format off
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __... | 927 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
class Solution {
public:
void solve() {
int n;
cin >> n;
vector<long long> a(n, 0);
for (int i = 0; i < n; i++) cin >> a[i];
vector<pair<long long, long long>> ai(n);
for (int i = 0; i < n; i++) ai[i] = make_pair(a[i], i);
sort(ai.begin(), ai.end(), greater... | 352 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
type... | 479 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long dp[2020][2020];
int main() {
int n; cin >> n;
int a[n]; for (int &i : a) cin >> i;
int p[n]; iota(p, p + n, 0);
sort(p, p + n, [&] (int x, int y) {
return a[x] > a[y];
});
for (int i = 0; i < n; i++) {
for (int j = 0; i + j ... | 271 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define eb emplace_back
#define PI 3.14159265
#define sz(c) (int)c.size()
#define len(c) (int)c.length()
#define hcf(a, b) __gcd(a, b)
#define all(c) c.rbegin(), c.rend()
... | 554 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<algorithm>
#include<cstring>
#define val first
#define pos second
typedef std::pair<long long, int> Point;
const int maxn = 2005;
int n;
long long ans, f[maxn][maxn];
Point p[maxn];
int main() {
memset(f, -0x3f, sizeof f);
scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
scanf("%lld",... | 323 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<ll,ll>
#define F first
#define S second
const int N=2e3+3;
pi a[N];
ll n,d[N][N];
ll go(ll l,ll r,ll i)
{
if(l>r) return 0ll;
else if(d[l][r]!=-1) return d[l][r];
ll lv=abs(a[i].S-l)*a[i].F+go(l+1ll,r,i+1);
ll rv... | 257 |
Project_CodeNet | 2,020 | // AtCoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include<math.h>
//#include<cmath>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<c... | 1,906 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll,ll>
#define vvll vector< vector<ll> >
#define pb push_back
#define sz... | 575 |
Project_CodeNet | 2,020 | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9... | 932 |
Project_CodeNet | 2,020 | #pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define... | 1,987 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n;
cin >> n;
pair <int, int> a[n];
for (int i = 0; i < n; ++i) cin >> a[i].first;
for (int i = 0; i < n; ++i) a[i].second = i;
sort(a, a + n);
reverse(a, a + n);
vector <vector <int> > dp(n, vector ... | 405 |
Project_CodeNet | 2,020 | /*input
1
1
*/
/*
______________
| )
| ) /
|______/
... | 958 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define itn int
#define For(i, a, b) for (int i = (a); i <= static_cast<int>(b); i++)
#define Forr(i, a, b) for (int i = (a); i >= static_cast<int>(b); i--)
#define rep(i, n) For(i, 0, n - 1)
#define repall(i, arr) for (auto& i : (arr))
#define all(x)... | 1,034 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<class T>inline bool chmax(T& a,T ... | 345 |
Project_CodeNet | 2,020 | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
ll GCD(ll a,ll b) {retur... | 407 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 881 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
struct pint
{
int a;
int i;
};
vector< vector<int> > dp;
int rec(int i,vector<pint>& a,int l,int r)
{
if(i==a.size())
return 0;
if(dp[i][r]!=-1)
return dp[i][r];
int ans=0;
ans=a[i].a*abs(l-a[i].i)+rec(i+1,a,l+1,... | 300 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long DP[2020][2020];
pair<long long,int> C[2020];
int main()
{
int N;
cin>>N;
for(int i=0;i<N;i++)
{
cin>>C[i].first;
C[i].second=i;
}
sort(C,C+N);
reverse(C,C+N);
for(int i=0;i<N;i++)
for(int j=0;j<=i;j++)
{
int k=i-j;
DP[j+1][k]=max(DP[j+1][k],DP... | 223 |
Project_CodeNet | 2,020 | /* Manish Pant - insider_pants, hello_my_friend */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define endl "\n"
#define pb push_back
typedef long long ll;
typedef long do... | 613 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typ... | 376 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> pli;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N; cin >> N;
vector<pli> v(N);
for(int i = 0; i < N; i++){
ll tmp;
cin >> tmp;
v[i] = make_pair(tmp, i);
}
sort(v.rbegin(),... | 353 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | 411 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
using ll = long long;
#define A... | 489 |
Project_CodeNet | 2,020 | #include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <cassert>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#i... | 1,685 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
void chmax(int64_t& a, int64_t b){
a = max(a, b);
}
int main(){
int N;
cin >> N;
vector<int64_t> A(N);
for(int i=0; i<N; i++) cin >> A[i];
vector<int> order;
for(int i=0; i<N; i++) order.push_back(i);
sort(order.begin(), order.end(), [&](in... | 263 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
constexpr ll INF = (1LL << 60) - 1LL;
constexpr ll MOD = 998244353LL... | 580 |
Project_CodeNet | 2,020 | // C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#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>
#i... | 1,014 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
struct P {
bool operator<(const P& p) const {
return a > p.a;
}
int a, i;
};
int main() {
int n;
scanf("%d", &n);
... | 333 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | 450 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d",&x);
#define sdl(x) scanf("%lld",&x);
#define pr(x) printf("%d\n",x);
#define prl(x) printf("%lld\n",x);
long long dp[2001][2001];
bool comp(pair<int,int>a,pair<int,int>b)
{
return a... | 439 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
const int MAX_N = 2005;
vector<P> A(MAX_N);
ll dp[MAX_N][MAX_N]; //dp[i][j] := 左にi人、右にj人
int main()
{
int N;
cin >> N;
rep(i,N)
{
ll a;
cin >> a;
A[i] = P(a,i+1);
}
sort(A... | 404 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long dp[2222][2222];
int main(){
int N;
cin >> N;
vector<long long> A(N);
for(auto &i:A)cin >> i;
vector<pair<long long,int>> c(N);
for(int i=0;i<N;i++)c[i]=make_pair(A[i],i);
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
for(int xy=1;xy<=N;xy++){... | 267 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <numeric>
using namespace std;
class IndexedActivity {
public:
int index;
long long activity;
IndexedActivity()
: index(0), activit... | 649 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
pair<long long, int> A[2010] = {};
for(int i = 0; i < N; i++){
cin >> A[i].first; A[i].second = i;
}
sort(A, A+N, greater<pair<long long, int>>());
long long dp[2010][2010] = {};
for(int i = 0; i <= N; i++){
for(int j = 0; j <= N;... | 383 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<numeric>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
using... | 363 |
Project_CodeNet | 2,020 | //#pragma GCC optimize("Ofast")
//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
// -Ofast
// -O3
// -O2
// -fsanitize=address
// -fsanitize=undefined
// add_compile_options()
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <algorith... | 528 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long n,dp[2005][2005];
pair<long long,long long> arr[2005];
long long rec(long long i,long long j)
{
if(dp[i][j]!=-1)return dp[i][j];
if(i > j)return 0;
long long idx = i+(n-j)-1;
long long x1 = abs(i-arr[idx].second)*arr[idx].first+rec(i+1,j);
l... | 239 |
Project_CodeNet | 2,020 | #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 pair<T,U... | 383 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (long long)(x).size()
#define sqr(x) (x)*(x)
#define sof sizeof
#define ins insert
#define lowerB lower_bound
#define upperB upper_bound
#define mkp make_pair
#define mod 1000000007
#... | 1,070 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
using pll = pair<ll,ll>;
ll n;
ll ans=0;
vector<pll> vt; //存value和index
ll dp[2005][2005];
ll cal(ll a,ll b,ll cnt){
if(a>b) return 0;
if(dp[a][b]!=-1) return dp[a][b];
return dp[a][b] = max(cal(a+1 , b , cnt+1) ... | 270 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<int,int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define togglebit(n,i) ((n)^(1... | 483 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstdint>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <utilit... | 1,308 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
long long n;
pair <long long,long long> a[2005];
long long dp[2005][2005];//dp[i][j]表示前i大的数，有j个被放到了左边
int main(int argc, char** argv) {
int n;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> a[i].first;
a[i].first=-a[i].first;
a[i].second=i;
}
sort(a+1... | 305 |
Project_CodeNet | 2,020 | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
... | 8,394 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define int long long
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define F first
#define S second
#define P pair
#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 V vector
#define RE return
#define ALL(a) a.begin... | 352 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | 1,344 |
Project_CodeNet | 2,020 | // #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((... | 1,259 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " <<... | 926 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,s,f) for(i=s;i<f;i++)
#define print(v) for(auto &z:v) cout<<z<<' ';cout<<'\n'
#define hi cout<<'h'<<'i'<<'\n'
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define B begin()
#define E end()
#define al... | 470 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, dp[2005][2005];
pair <ll, ll> a[2005];
bool cmp (pair <ll, ll> a, pair <ll, ll> b) {
return (a.first>b.first);
}
ll hitung (ll x, ll y) {
if (x>n) return 0;
if (dp[x][y]==-1) {
ll kiri=hitung(x+1, y+1)+a[x].first*abs(a[x].second-y-1);
l... | 254 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int N;
pair<int, int> p[2020];
ll dp[2020][2020];
void solve(){
int i, j, k, l, r, x, y;
string s;
cin >> N;
rep(i, N){
cin >> x;
p[i] = {x, i};
}
sort(p, p+N);
... | 322 |
Project_CodeNet | 2,020 |
// Problem : E - Active Infants
// Contest : AtCoder - AtCoder Beginner Contest 163
// URL : https://atcoder.jp/contests/abc163/tasks/abc163_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
//QWsin
#include<vector>
#include<cstdio>
#include<cstring>
#i... | 497 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n;
cin>>n;
vector<pair<ll,ll>> arr;
for(int i=0;i<n;i++)
{
ll x;cin>> x;
arr.push_back({x,i});
}
sort(arr.begin(),arr.end(),greater<pair<ll,ll>>());
vector<vector<ll>> dp... | 281 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
long long N;
cin >> N;
vector<pair<long long,long long>> V(2010);
for(int i = 1; i<= N; i++){
long long A;
cin >> A;
V[i] = make_pair((-1)*A, i);
}
sort(V.begin(), V.end());
vector<v... | 477 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 842 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int ... | 350 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
int arr[2010];
long long dp[2010][2010];
long long tabs(int a, int b) {
if (a > b) return a - b;
return... | 518 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#ifndef modint_hpp
#define modint_hpp
#include <cassert>
#include <iostream>
template <int mod>
class modint
{
int val;
public:
constexpr modint() noexcept : val{0} {}
constexpr modint(long long x) noexcept :... | 1,607 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
//increase stack size
#pragma comment(linker, "/STACK:16777216")
ll mxm() {return LLONG_MIN;}
template<typename... Args>
ll mxm(ll a, Args... args) { return max(a,mxm(args...)); }
ll m... | 865 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long int ll;
int N;
ll activity[2005];
int indices[2005];
ll dp[2002][2002];
int comp(int a,int b){
return activity[a]>activity[b];
}
int main(){
scanf("%d",&N);
for(int i=1;i<=N;i++){
scanf("%lld",activity+i);
in... | 248 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
using namespace std;
typede... | 424 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
// 子どもを表す構造体
struct infant{
int position; // 位置
int64_t lively; // 活発度
// 活発度が同じ場合、位置で判断する
bool operator<( const infant &right ) const{
return lively == right.lively ? position < right.position : lively < right.lively;
}
... | 683 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2005;
int n, a[N];
int id[N];
ll dp[N][N];
ll f(int l, int r) {
int i = n - (r - l + 1);
int p = id[i];
if(l == r) return 1LL * a[p] * abs(p - l);
ll &ans = dp[l][r];
if(~ans) return ans;
ans = -1e18;
ans = max(ans, f(l + 1, r... | 257 |
Project_CodeNet | 2,020 | // !Start && !End
// 0 se divide
//https: //www.youtube.com/watch?v=6Nb-prB-4P0&list=RD6Nb-prB-4P0&start_radio=1
// https: //www.youtube.com/watch?v=eYDI8b5Nn5s
// Electrify my OOOoooooOOOoooOOOOOoooooOOOooo!
#pragma optimise GCC(-O2)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long ... | 866 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 2e3 + 5;
const ll linf = 0x3f3f3f3f3f3f3f3f;
inline void chk_max(ll &a,ll b){ if(a<b) a=b;}
inline int Abs(int x){ return x<0? -x: x;}
struct Node
{
int val,id;
}a[MAXN];
inline bool cmp... | 671 |
Project_CodeNet | 2,020 | //#pragma GCC optimize ("O3","unroll-loops")
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<functional>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<unordered_set>
#inclu... | 1,854 |
Project_CodeNet | 2,020 | /**
If comrades that you trust gather around you, hope can take physical form and become visible. That’s what I believe.
*/
#include <bits/stdc++.h>
using namespace std;
/**
(▀̿Ĺ̯▀̿ ̿) (ง ͠° ͟ل͜ ͡°)ง
*/
using ll = long long;
const int N = 2e3 + 7;
pair<ll, int> a[N];
ll dp[N][N];
int n;
ll solve(int l, int r) {
au... | 402 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
mt19937 rng(chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count());
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int N=1000005;
#define M 1000000000
#define d... | 438 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define endl '\n'
#define ll long long
const int N = 2e3 + 5;
pair<ll, ll> a[N];
ll dp[N][N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen("VLJUM.INP", "r", stdin);
/... | 339 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
struct abc {
long long v;
int id;
bool operator < (const abc &a) const {
return v > a.v;
}
}a[2010];
long long f[2010][2010];
int main() {
int n, i, l, r;
scanf("%d", &n);
for (i = 0; i < n; i++) {
... | 296 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
int main(){
int n;
std::cin >> n;
std::vector<long long int> a(n);
for (auto& itr : a)
{
int tmp;
std::cin >> tmp;
itr = tmp;
}
std::vector<int> index(n);
std::iota(index.begin(), index.end(),... | 337 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<set>
#include<stack>
#include<sstream>
//#include <Eigen/Dense>
//#include <Eigen/Geometry>
//using namespace Eigen;
using na... | 332 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
// 型シノニム
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
// 定数
constexpr ll INF = 1e16;
constexpr ll INM = 114514;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-12;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll ... | 747 |
Project_CodeNet | 2,020 | /*
* @Author: Kaizyn
* @Date: 2020-04-26 17:06:58
* @LastEditTime: 2020-04-26 18:15:02
*/
#include <bits/stdc++.h>
// #define DEBUG
using namespace std;
const int N = 2e3+7;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
const double PI = acos(-1);
typedef pair<int, int> pii;
st... | 483 |
Project_CodeNet | 2,020 | #include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | 754 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e3 + 5;
ll f[N][N];
pair<int, int> p[N];
ll cal(int cnt, int l, int r) {
if(l > r) return 0;
if(~f[l][r]) return f[l][r];
ll ans = 1LL * p[cnt].first * abs(p[cnt].second - l) + cal(cnt + 1, l + 1, r);
ans = max(ans, 1LL * ... | 280 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin); freopen("outp.txt", "w", stdout);
#endif
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
... | 368 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
int n;
vector<LL> a;
vector<vector<LL>> dp;
LL solve() {
if (n == 1)
return 0;
vector<pair<LL, LL>> order;
dp = vector<vector<LL>>(n + 1, vector<LL>(n + 1, 0));
for (int i = 0; i < n; i++)
order.emplace_back(a[i], i);
sort(order.begin()... | 486 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define pb push_back
#define vi vector<int >
#define vii vector < pair<int ,int > >
#... | 498 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class U>
void chmax(T &a... | 543 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string ... | 748 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#d... | 688 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) x.begin(),x.end()
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb(x) push_back(x)
#define eb emplace_back
#define SORT(ls) sort(ls.begin(), ls.end())
#define DESC(ls) sort(ls.rbegin(), ls.rend())
#d... | 577 |
Project_CodeNet | 2,020 | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> a(n);
vector<pair<ll,ll>> b(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
b[i] = {a[i],i};
}
sort(b.rbegin(),b.rend());
// map<pair<ll,ll>,ll>... | 413 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x) for(ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "... | 763 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2000+10;
struct node{int k,p;}a[N];
int n,f[N][N],ans;
bool cmp(node x,node y){return x.k>y.k;}
signed main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i].k);
a[i].p=i;
}
sort(a+1,a+n+1,cmp);
for(int i=0;i<n;i++)
... | 258 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
ll MOD=1000000007;
int main() {
ll n;
... | 293 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <utility>
#include <numeric>
using namespace std;
template<class T>
class Min_Cost_Flow{
public:
struct edge{
int to;
int cap;
T cost;
int rev;
bool is_rev;
};
const T INF;
vector<vector<e... | 1,789 |
Project_CodeNet | 2,020 | ///#pragma GCC optimize("O3,unroll-loops")
///#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define inf 2000000000
#define infLL ... | 1,045 |
Project_CodeNet | 2,020 | /*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int lli;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define... | 676 |
Project_CodeNet | 2,020 |
//#pragma GCC optimize ("-O3")
#include <iostream>
#include <cmath>
#include <vector>
#include <stack>
#include <cstdio>
#include <string>
#include <bitset>
#include <list>
#include <set>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <functional>
#include <queue>
#include <regex>
#include <... | 5,138 |
Project_CodeNet | 2,020 | #ifndef DEBUG
# define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>
#include <array>
using namespace std;
// template {{{
// misc {{{
using Z = long long... | 1,175 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<pair<int, int> > A(N);
int res = 0;
for (int i = 0; i < N; i++) {
cin >> A[i].first;
A[i].second = i;
}
sort(A.rbegin(), A.rend(... | 345 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int64_t abso(int64_t x) {
return max(x, -x);
}
int64_t dp[2005][2005];
int main() {
int64_t N;
cin >> N;
vector<pair<int64_t, int64_t>> v(N);
for (int64_t i = 0; i < N; i++) {
int64_t x;
cin >> x;
v.at(i).first=x;
v.at(i).second=i;
}
sort(... | 308 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define read(num) scanf("%d", &num)
#define readll(num) scanf("%lld", &num)
#define read2(num1, num2) scanf("%d%d", &num1, &num2)
#define read3(num1, num2, num3) scanf("%d%d%d", &num1, &num2, &num3)
#define reads(str) scanf("%s", str)
#define readc(ch) scanf("%c", &ch)
#d... | 431 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <algorithm>
using namespace std;
#define int long long
#define N 2005
int n,f[N][N],ans=0;
pair <int,int> a[N];
inline int read(){
int s=0,t=1;
char c=getchar();
while((c<'0'||c>'9')&&c!='-')c=getchar();
if(c=='-')c=getchar(),t=-1;
while(c>='0'&&c<='9')s=(s<<1)+(s<<3)+(c^48),c=getchar... | 314 |
Project_CodeNet | 2,020 | //INCLUDE
//------------------------------------------
#include <bits/stdc++.h>
//DEFINE
//------------------------------------------
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vect... | 527 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin()... | 1,113 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.