Codeforces Round #261 (Div. 2)

C.Pashmak and Buses

构造

看成k进制的d位数。。

n,k,d = map(int, raw_input().split())
if n > k**d: print -1
else:
    ans = []
    for i in range(n):
        tmp = i
        cur = []
        for j in range(d):
            cur.append(tmp%k+1)
            tmp /= k
        ans.append(cur)
    for i in range(d):
        for j in ans:
            print j[i],
        print ''

D.http://codeforces.com/contest/459/problem/D

树状数组求逆序数

没怎么看懂思路。。噗。。

参考：http://www.cnblogs.com/yuiffy/p/3916512.html

E.http://codeforces.com/contest/459/problem/E

/*Author :usedrose  */
/*Created Time :2015/8/9 21:56:08*/
/*File Name :2.cpp*/
#pragma comment(linker, "/STACK:1024000000,1024000000") 
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <vector>
#include <string>
#include <ctime>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define pi acos(-1.0)
#define MAXN 1110
#define MAXM 300110
#define OK cout << "ok" << endl;
#define o(a) cout << #a << " = " << a << endl
#define o1(a,b) cout << #a << " = " << a << "  " << #b << " = " << b << endl
using namespace std;
typedef long long LL;

struct node {
    int u, v, w;
    bool operator<(const node& ss) const {
        return w < ss.w;
    }
}e[MAXM];
int n, m;
int dp[MAXM], g[MAXM];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 0;i < m; ++ i) 
        cin >> e[i].u >> e[i].v >> e[i].w;
    sort(e, e + m);
    int t = 0, ans = 0;
    for (int i = 0;i < m; ++ i) {
        dp[i] = g[e[i].u] + 1;
        if (e[i].w != e[i+1].w) {
            for (int j = t; j <= i; ++ j)
                g[e[j].v] = max(dp[j], g[e[j].v]);
            t = i+1;
        }
        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
    return 0;
}

参考

http://blog.csdn.net/y990041769/article/details/38709519