제출 #18100

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
18100	2016-01-20 07:53:20	atomzeno	매트 (KOI15_mat)	C++98	100 / 100	56 ms	106740 KiB

mat

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define MX 3001
int n,w,cnt[2],b[MX],c[MX],ans=0,D[MX][MX],DA[MX][MX],DB[MX][MX];
struct DT{
    int x1,x2,w,val;
    bool operator<(const DT&r)const{
        return r.x2>x2;
    }
}up[MX],down[MX];
int pos(int x,int y){
    if((up[x].w+down[y].w)>w){
        if(up[x].x2<=down[y].x1||up[x].x1>=down[y].x2){return 1;}
        return 0;
    }
    else{
        return 1;
    }
}
void RDA(int x,int y){
    if(up[x].x1>=down[y].x2){
        DA[x][y]=up[x].val+D[b[x]][y];//
    }
    else if(up[x].x2<=down[y].x1){
        DA[x][y]=max(DA[x][y-1],DA[x][c[y]]+down[y].val);//
    }
    else if(up[x].x1<=down[y].x1&&down[y].x1<=up[x].x2){
        DA[x][y]=max(DA[x][y-1],DA[x][c[y]]+down[y].val);//
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 13 / 13
• Subtask 3: 25 / 25
• Subtask 4: 11 / 11
• Subtask 5: 43 / 43